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 915, Fri Aug 24 18:21:00 2001 UTC revision 1132, Mon Mar 11 18:32:50 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
17    Date: 2002/03/11 13:30:00 EST
18    Tag: blume-20020311-mltreeeval
19    Description:
20    
21    A functor parameter was missing.
22    
23    ----------------------------------------------------------------------
24    Name: Allen Leung
25    Date: 2002/03/11 10:30:00 EST
26    Tag: leunga-20020310-runtime-string0
27    Description:
28    
29       The representation of the empty string now points to a
30    legal null terminated C string instead of unit.  It is now possible
31    to convert an ML string into C string with InlineT.CharVector.getData.
32    This compiles into one single machine instruction.
33    
34    ----------------------------------------------------------------------
35    Name: Allen Leung
36    Date: 2002/03/10 23:55:00 EST
37    Tag: leunga-20020310-x86-call
38    Description:
39    
40       Added machine generation for CALL instruction (relative displacement mode)
41    
42    ----------------------------------------------------------------------
43    Name: Matthias Blume
44    Date: 2002/03/08 16:05:00
45    Tag: blume-20020308-entrypoints
46    Description:
47    
48    Version number bumped to 110.39.1.  NEW BOOTFILES!
49    
50    Entrypoints: non-zero offset into a code object where execution should begin.
51    
52    - Added the notion of an entrypoint to CodeObj.
53    - Added reading/writing of entrypoint info to Binfile.
54    - Made runtime system bootloader aware of entrypoints.
55    - Use the address of the label of the first function given to mlriscGen
56      as the entrypoint.  This address is currently always 0, but it will
57      not be 0 once we turn on block placement.
58    - Removed the linkage cluster code (which was The Other Way(tm) of dealing
59      with entry points) from mlriscGen.
60    
61    ----------------------------------------------------------------------
62    Name: Allen Leung
63    Date: 2002/03/07 20:45:00 EST
64    Tag: leunga-20020307-x86-cmov
65    Description:
66    
67       Bug fixes for CMOVcc on x86.
68    
69       1. Added machine code generation for CMOVcc
70       2. CMOVcc is now generated in preference over SETcc on PentiumPro or above.
71       3. CMOVcc cannot have an immediate operand as argument.
72    
73    ----------------------------------------------------------------------
74    Name: Matthias Blume
75    Date: 2002/03/07 16:15:00 EST
76    Tag: blume-20020307-controls
77    Description:
78    
79    This is a very large but mostly boring patch which makes (almost)
80    every tuneable compiler knob (i.e., pretty much everything under
81    Control.* plus a few other things) configurable via both the command
82    line and environment variables in the style CM did its configuration
83    until now.
84    
85    Try starting sml with '-h' (or, if you are brave, '-H')
86    
87    To this end, I added a structure Controls : CONTROLS to smlnj-lib.cm which
88    implements the underlying generic mechanism.
89    
90    The interface to some of the existing such facilities has changed somewhat.
91    For example, the MLRiscControl module now provides mkFoo instead of getFoo.
92    (The getFoo interface is still there for backward-compatibility, but its
93    use is deprecated.)
94    
95    The ml-build script passes -Cxxx=yyy command-line arguments through so
96    that one can now twiddle the compiler settings when using this "batch"
97    compiler.
98    
99    TODO items:
100    
101    We should go through and throw out all controls that are no longer
102    connected to anything.  Moreover, we should go through and provide
103    meaningful (and correct!) documentation strings for those controls
104    that still are connected.
105    
106    Currently, multiple calls to Controls.new are accepted (only the first
107    has any effect).  Eventually we should make sure that every control
108    is being made (via Controls.new) exactly once.  Future access can then
109    be done using Controls.acc.
110    
111    Finally, it would probably be a good idea to use the getter-setter
112    interface to controls rather than ref cells.  For the time being, both
113    styles are provided by the Controls module, but getter-setter pairs are
114    better if thread-safety is of any concern because they can be wrapped.
115    
116    *****************************************
117    
118    One bug fix: The function blockPlacement in three of the MLRISC
119    backpatch files used to be hard-wired to one of two possibilities at
120    link time (according to the value of the placementFlag).  But (I
121    think) it should rather sense the flag every time.
122    
123    *****************************************
124    
125    Other assorted changes (by other people who did not supply a HISTORY entry):
126    
127    1. the cross-module inliner now works much better (Monnier)
128    2. representation of weights, frequencies, and probabilities in MLRISC
129       changed in preparation of using those for weighted block placement
130       (Reppy, George)
131    
132    ----------------------------------------------------------------------
133    Name: Lal George
134    Date: 2002/03/07 14:44:24 EST 2002
135    Tag: george-20020307-weighted-block-placement
136    
137    Tested the weighted block placement optimization on all architectures
138    (except the hppa) using AMPL to generate the block and edge frequencies.
139    Changes were required in the machine properties to correctly
140    categorize trap instructions. There is an MLRISC flag
141    "weighted-block-placement" that can be used to enable weighted block
142    placement, but this will be ineffective without block/edge
143    frequencies (coming soon).
144    
145    
146    ----------------------------------------------------------------------
147    Name: Lal George
148    Date: 2002/03/05 17:24:48 EST
149    Tag: george-20020305-linkage-cluster
150    
151    In order to support the block placement optimization, a new cluster
152    is generated as the very first cluster (called the linkage cluster).
153    It contains a single jump to the 'real' entry point for the compilation
154    unit. Block placement has no effect on the linkage cluster itself, but
155    all the other clusters  have full freedom in the manner in which they
156    reorder blocks or functions.
157    
158    On the x86 the typical linkage code that is generated is:
159       ----------------------
160            .align 2
161       L0:
162            addl    $L1-L0, 72(%esp)
163            jmp     L1
164    
165    
166            .align  2
167       L1:
168       ----------------------
169    
170    72(%esp) is the memory location for the stdlink register. This
171    must contain the address of the CPS function being called. In the
172    above example, it contains the address of  L0; before
173    calling L1 (the real entry point for the compilation unit), it
174    must contain the address for L1, and hence
175    
176            addl $L1-L0, 72(%esp)
177    
178    I have tested this on all architectures except the hppa.The increase
179    in code size is of course negligible
180    
181    ----------------------------------------------------------------------
182    Name: Allen Leung
183    Date: 2002/03/03 13:20:00 EST
184    Tag: leunga-20020303-mlrisc-tools
185    
186      Added #[ ... ] expressions to mlrisc tools
187    
188    ----------------------------------------------------------------------
189    Name: Matthias Blume
190    Date: 2002/02/27 12:29:00 EST
191    Tag: blume-20020227-cdebug
192    Description:
193    
194    - made types in structure C and C_Debug to be equal
195    - got rid of code duplication (c-int.sml vs. c-int-debug.sml)
196    - there no longer is a C_Int_Debug (C_Debug is directly derived from C)
197    
198    ----------------------------------------------------------------------
199    Name: Matthias Blume
200    Date: 2002/02/26 12:00:00 EST
201    Tag: blume-20020226-ffi
202    Description:
203    
204    1. Fixed a minor bug in CM's "noweb" tool:
205       If numbering is turned off, then truly don't number (i.e., do not
206       supply the -L option to noweb).  The previous behavior was to supply
207       -L'' -- which caused noweb to use the "default" line numbering scheme.
208       Thanks to Chris Richards for pointing this out (and supplying the fix).
209    
210    2. Once again, I reworked some aspects of the FFI:
211    
212       A. The incomplete/complete type business:
213    
214       - Signatures POINTER_TO_INCOMPLETE_TYPE and accompanying functors are
215         gone!
216       - ML types representing an incomplete type are now *equal* to
217         ML types representing their corresponding complete types (just like
218         in C).  This is still safe because ml-nlffigen will not generate
219         RTTI for incomplete types, nor will it generate functions that
220         require access to such RTTI.   But when ML code generated from both
221         incomplete and complete versions of the C type meet, the ML types
222         are trivially interoperable.
223    
224         NOTE:  These changes restore the full generality of the translation
225         (which was previously lost when I eliminated functorization)!
226    
227       B. Enum types:
228    
229       - Structure C now has a type constructor "enum" that is similar to
230         how the "su" constructor works.  However, "enum" is not a phantom
231         type because each "T enum" has values (and is isomorphic to
232         MLRep.Signed.int).
233       - There are generic access operations for enum objects (using
234         MLRep.Signed.int).
235       - ml-nlffigen will generate a structure E_foo for each "enum foo".
236         * The structure contains the definition of type "mlrep" (the ML-side
237         representation type of the enum).  Normally, mlrep is the same
238         as "MLRep.Signed.int", but if ml-nlffigen was invoked with "-ec",
239         then mlrep will be defined as a datatype -- thus facilitating
240         pattern matching on mlrep values.
241         ("-ec" will be suppressed if there are duplicate values in an
242          enumeration.)
243         * Constructors ("-ec") or values (no "-ec") e_xxx of type mlrep
244         will be generated for each C enum constant xxx.
245         * Conversion functions m2i and i2m convert between mlrep and
246         MLRep.Signed.int.  (Without "-ec", these functions are identities.)
247         * Coversion functions c and ml convert between mlrep and "tag enum".
248         * Access functions (get/set) fetch and store mlrep values.
249       - By default (unless ml-nlffigen was invoked with "-nocollect"), unnamed
250         enumerations are merged into one single enumeration represented by
251         structure E_'.
252    
253    ----------------------------------------------------------------------
254    Name: Allen Leung
255    Date: 2002/02/25 04:45:00 EST
256    Tag: leunga-20020225-cps-spill
257    
258    This is a new implementation of the CPS spill phase.
259    The new phase is in the new file compiler/CodeGen/cpscompile/spill-new.sml
260    In case of problems, replace it with the old file spill.sml
261    
262    The current compiler runs into some serious performance problems when
263    constructing a large record.  This can happen when we try to compile a
264    structure with many items.  Even a very simple structure like the following
265    makes the compiler slow down.
266    
267        structure Foo = struct
268           val x_1 = 0w1 : Word32.int
269           val x_2 = 0w2 : Word32.int
270           val x_3 = 0w3 : Word32.int
271           ...
272           val x_N = 0wN : Word32.int
273        end
274    
275    The following table shows the compile time, from N=1000 to N=4000,
276    with the old compiler:
277    
278    N
279    1000   CPS 100 spill                           0.04u  0.00s  0.00g
280           MLRISC ra                               0.06u  0.00s  0.05g
281              (spills = 0 reloads = 0)
282           TOTAL                                   0.63u  0.07s  0.21g
283    
284    1100   CPS 100 spill                           8.25u  0.32s  0.64g
285           MLRISC ra                               5.68u  0.59s  3.93g
286              (spills = 0 reloads = 0)
287           TOTAL                                   14.71u  0.99s  4.81g
288    
289    1500   CPS 100 spill                           58.55u  2.34s  1.74g
290           MLRISC ra                               5.54u  0.65s  3.91g
291              (spills = 543 reloads = 1082)
292           TOTAL                                   65.40u  3.13s  6.00g
293    
294    2000   CPS 100 spill                           126.69u  4.84s  3.08g
295           MLRISC ra                               0.80u  0.10s  0.55g
296              (spills = 42 reloads = 84)
297           TOTAL                                   129.42u  5.10s  4.13g
298    
299    3000   CPS 100 spill                           675.59u  19.03s  11.64g
300           MLRISC ra                               2.69u  0.27s  1.38g
301              (spills = 62 reloads = 124)
302           TOTAL                                   682.48u  19.61s  13.99g
303    
304    4000   CPS 100 spill                           2362.82u  56.28s  43.60g
305           MLRISC ra                               4.96u  0.27s  2.72g
306              (spills = 85 reloads = 170)
307           TOTAL                                   2375.26u  57.21s  48.00g
308    
309    As you can see the old cps spill module suffers from some serious
310    performance problem.  But since I cannot decipher the old code fully,
311    instead of patching the problems up, I'm reimplementing it
312    with a different algorithm.  The new code is more modular,
313    smaller when compiled, and substantially faster
314    (O(n log n) time and O(n) space).  Timing of the new spill module:
315    
316    4000  CPS 100 spill                           0.02u  0.00s  0.00g
317          MLRISC ra                               0.25u  0.02s  0.15g
318             (spills=1 reloads=3)
319          TOTAL                                   7.74u  0.34s  1.62g
320    
321    Implementation details:
322    
323    As far as I can tell, the purpose of the CPS spill module is to make sure the
324    number of live variables at any program point (the bandwidth)
325    does not exceed a certain limit, which is determined by the
326    size of the spill area.
327    
328    When the bandwidth is too large, we decrease the register pressure by
329    packing live variables into spill records.  How we achieve this is
330    completely different than what we did in the old code.
331    
332    First, there is something about the MLRiscGen code generator
333    that we should be aware of:
334    
335    o MLRiscGen performs code motion!
336    
337       In particular, it will move floating point computations and
338       address computations involving only the heap pointer to
339       their use sites (if there is only a single use).
340       What this means is that if we have a CPS record construction
341       statement
342    
343           RECORD(k,vl,w,e)
344    
345       we should never count the new record address w as live if w
346       has only one use (which is often the case).
347    
348       We should do something similar to floating point, but the transformation
349       there is much more complex, so I won't deal with that.
350    
351    Secondly, there are now two new cps primops at our disposal:
352    
353     1. rawrecord of record_kind option
354        This pure operator allocates some uninitialized storage from the heap.
355        There are two forms:
356    
357         rawrecord NONE [INT n]  allocates a tagless record of length n
358         rawrecord (SOME rk) [INT n] allocates a tagged record of length n
359                                     and initializes the tag.
360    
361     2. rawupdate of cty
362          rawupdate cty (v,i,x)
363          Assigns to x to the ith component of record v.
364          The storelist is not updated.
365    
366    We use these new primops for both spilling and increment record construction.
367    
368     1. Spilling.
369    
370        This is implemented with a linear scan algorithm (but generalized
371        to trees).  The algorithm will create a single spill record at the
372        beginning of the cps function and use rawupdate to spill to it,
373        and SELECT or SELp to reload from it.  So both spills and reloads
374        are fine-grain operations.  In contrast, in the old algorithm
375        "spills" have to be bundled together in records.
376    
377        Ideally, we should sink the spill record construction to where
378        it is needed.  We can even split the spill record into multiple ones
379        at the places where they are needed.  But CPS is not a good
380        representation for global code motion, so I'll keep it simple and
381        am not attempting this.
382    
383     2. Incremental record construction (aka record splitting).
384    
385        Long records with many component values which are simulatenously live
386        (recall that single use record addresses are not considered to
387         be live) are constructed with rawrecord and rawupdate.
388        We allocate space on the heap with rawrecord first, then gradually
389        fill it in with rawupdate.  This is the technique suggested to me
390        by Matthias.
391    
392        Some restrictions on when this is applicable:
393        1. It is not a VECTOR record.  The code generator currently does not handle
394           this case. VECTOR record uses double indirection like arrays.
395        2. All the record component values are defined in the same "basic block"
396           as the record constructor.  This is to prevent speculative
397           record construction.
398    
399    ----------------------------------------------------------------------
400    Name: Allen Leung
401    Date: 2002/02/22 01:02:00 EST
402    Tag: leunga-20020222-mlrisc-tools
403    
404    Minor bug fixes in the parser and rewriter
405    
406    ----------------------------------------------------------------------
407    Name: Allen Leung
408    Date: 2002/02/21 20:20:00 EST
409    Tag: leunga-20020221-peephole
410    
411    Regenerated the peephole files.  Some contained typos in the specification
412    and some didn't compile because of pretty printing bugs in the old version
413    of 'nowhere'.
414    
415    ----------------------------------------------------------------------
416    Name: Allen Leung
417    Date: 2002/02/19 20:20:00 EST
418    Tag: leunga-20020219-mlrisc-tools
419    Description:
420    
421       Minor bug fixes to the mlrisc-tools library:
422    
423       1.  Fixed up parsing colon suffixed keywords
424       2.  Added the ability to shut the error messages up
425       3.  Reimplemented the pretty printer and fixed up/improved
426           the pretty printing of handle and -> types.
427       4.  Fixed up generation of literal symbols in the nowhere tool.
428       5.  Added some SML keywords to to sml.sty
429    
430    ----------------------------------------------------------------------
431    Name: Matthias Blume
432    Date: 2002/02/19 16:20:00 EST
433    Tag: blume-20020219-cmffi
434    Description:
435    
436    A wild mix of changes, some minor, some major:
437    
438    * All C FFI-related libraries are now anchored under $c:
439        $/c.cm      --> $c/c.cm
440        $/c-int.cm  --> $c/internals/c-int.cm
441        $/memory.cm --> $c/memory/memory.cm
442    
443    * "make" tool (in CM) now treats its argument pathname slightly
444      differently:
445        1. If the native expansion is an absolute name, then before invoking
446           the "make" command on it, CM will apply OS.Path.mkRelative
447           (with relativeTo = OS.FileSys.getDir()) to it.
448        2. The argument will be passed through to subsequent phases of CM
449           processing without "going native".  In particular, if the argument
450           was an anchored path, then "make" will not lose track of that anchor.
451    
452    * Compiler backends now "know" their respective C calling conventions
453      instead of having to be told about it by ml-nlffigen.  This relieves
454      ml-nlffigen from one of its burdens.
455    
456    * The X86Backend has been split into X86CCallBackend and X86StdCallBackend.
457    
458    * Export C_DEBUG and C_Debug from $c/c.cm.
459    
460    * C type encoding in ml-nlffi-lib has been improved to model the conceptual
461      subtyping relationship between incomplete pointers and their complete
462      counterparts.  For this, ('t, 'c) ptr has been changed to 'o ptr --
463      with the convention of instantiating 'o with ('t, 'c) obj whenever
464      the pointer target type is complete.  In the incomplete case, 'o
465      will be instantiated with some "'c iobj" -- a type obtained by
466      using one of the functors PointerToIncompleteType or PointerToCompleteType.
467    
468      Operations that work on both incomplete and complete pointer types are
469      typed as taking an 'o ptr while operations that require the target to
470      be known are typed as taking some ('t, 'c) obj ptr.
471    
472      voidptr is now a bit "more concrete", namely "type voidptr = void ptr'"
473      where void is an eqtype without any values.  This makes it possible
474      to work on voidptr values using functions meant to operate on light
475      incomplete pointers.
476    
477    * As a result of the above, signature POINTER_TO_INCOMPLETE_TYPE has
478      been vastly simplified.
479    
480    ----------------------------------------------------------------------
481    Name: Matthias Blume
482    Date: 2002/02/19 10:48:00 EST
483    Tag: blume-20020219-pqfix
484    Description:
485    
486    Applied Chris Okasaki's bug fix for priority queues.
487    
488    ----------------------------------------------------------------------
489    Name: Matthias Blume
490    Date: 2002/02/15 17:05:00
491    Tag: Release_110_39
492    Description:
493    
494    Last-minute retagging is becoming a tradition... :-(
495    
496    This is the working release 110.39.
497    
498    ----------------------------------------------------------------------
499    Name: Matthias Blume
500    Date: 2002/02/15 16:00:00 EST
501    Tag: Release_110_39-orig
502    Description:
503    
504    Working release 110.39.  New bootfiles.
505    
506    (Update: There was a small bug in the installer so it wouldn't work
507    with all shells.  So I retagged. -Matthias)
508    
509    ----------------------------------------------------------------------
510    Name: Matthias Blume
511    Date: 2002/02/15 14:17:00 EST
512    Tag: blume-20020215-showbindings
513    Description:
514    
515    Added EnvRef.listBoundSymbols and CM.State.showBindings.  Especially
516    the latter can be useful for exploring what bindings are available at
517    the interactive prompt.  (The first function returns only the list
518    of symbols that are really bound, the second prints those but also the
519    ones that CM's autoloading mechanism knows about.)
520    
521    ----------------------------------------------------------------------
522    Name: Matthias Blume
523    Date: 2002/02/15 12:08:00 EST
524    Tag: blume-20020215-iptrs
525    Description:
526    
527    Two improvements to ml-nlffigen:
528    
529      1. Write files only if they do not exist or if their current contents
530         do not coincide with what's being written.  (That is, avoid messing
531         with the time stamps unless absolutely necessary.)
532    
533      2. Implement a "repository" mechanism for generated files related
534         to "incomplete pointer types".   See the README file for details.
535    
536    ----------------------------------------------------------------------
537    Name: Matthias Blume
538    Date: 2002/02/14 11:50:00 EST
539    Tag: blume-20020214-quote
540    Description:
541    
542    Added a type 't t_' to tag.sml (in ml-nlffi-lib.cm).  This is required
543    because of the new and improved tag generation scheme.  (Thanks to Allen
544    Leung for pointing it out.)
545    
546    ----------------------------------------------------------------------
547    Name: Lal George
548    Date: 2002/02/14 09:55:27 EST 2002
549    Tag: george-20020214-isabelle-bug
550    Description:
551    
552    Fixed the MLRISC bug sent by Markus Wenzel regarding the compilation
553    of Isabelle on the x86.
554    
555    From Allen:
556    -----------
557     I've found the problem:
558    
559         in ra-core.sml, I use the counter "blocked" to keep track of the
560         true number of elements in the freeze queue.  When the counter goes
561         to zero, I skip examining the queue.  But I've messed up the
562         bookkeeping in combine():
563    
564             else ();
565             case !ucol of
566               PSEUDO => (if !cntv > 0 then
567                     (if !cntu > 0 then blocked := !blocked - 1 else ();
568                                        ^^^^^^^^^^^^^^^^^^^^^^^
569                      moveu := mergeMoveList(!movev, !moveu)
570                     )
571                  else ();
572    
573         combine() is called to coalesce two nodes u and v.
574         I think I was thinking that if the move counts of u and v are both
575         greater than zero then after they are coalesced then one node is
576         removed from the freeze queue.  Apparently I was thinking that
577         both u and v are of low degree, but that's clearly not necessarily true.
578    
579    
580    02/12/2002:
581        Here's the patch.  HOL now compiles.
582    
583        I don't know how this impact on performance (compile
584        time or runtime).  This bug caused the RA (especially on the x86)
585        to go thru the potential spill phase when there are still nodes on the
586        freeze queue.
587    
588    
589    
590    
591    ----------------------------------------------------------------------
592    Name: Matthias Blume
593    Date: 2002/02/13 22:40:00 EST
594    Tag: blume-20020213-fptr-rtti
595    Description:
596    
597    Fixed a bug in ml-nlffigen that was introduced with one of the previous
598    updates.
599    
600    ----------------------------------------------------------------------
601    Name: Matthias Blume
602    Date: 2002/02/13 16:41:00 EST
603    Tag: blume-20020213-cmlpq
604    Description:
605    
606    Added new priority queue export symbols (which have just been added to
607    smlnj-lib.cm) to CML's version of smlnj-lib.cm.  (Otherwise CML would
608    not compile and the installer would choke.)
609    
610    ----------------------------------------------------------------------
611    Name: Matthias Blume
612    Date: 2002/02/13 16:15:00 EST
613    Tag: blume-20020213-various
614    Description:
615    
616    1. More tweaks to ml-nlffigen:
617    
618       - better internal datastructures (resulting in slight speedup)
619       - "-match" option requires exact match
620       - "localized" gensym counters (untagged structs/unions nested within
621         other structs/unions or within typedefs get a fresh counter; their
622         tag will be prefixed by a concatenation of their parents' tags)
623       - bug fixes (related to calculation of transitive closure of types
624         to be included in the output)
625    
626    2. Minor Basis updates:
627    
628       - added implementations for List.collate and Option.app
629    
630    ----------------------------------------------------------------------
631    Name: Matthias Blume
632    Date: 2002/02/11 15:55:00 EST
633    Tag: blume-20020211-gensym
634    Description:
635    
636    Added a "-gensym" option to command line of ml-nlffigen.  This can be
637    used to specify a "stem" -- a string that is inserted in all "gensym'd"
638    names (ML structure names that correspond to unnamed C structs, unions,
639    and enums), so that separate runs of ml-nlffigen do not clash.
640    
641    ----------------------------------------------------------------------
642    Name: Matthias Blume
643    Date: 2002/02/11 12:05:00 EST
644    Tag: blume-20020211-gensml
645    Description:
646    
647    A quick fix for a problem with GenSML (in the pgraph-util library):
648    Make generation of toplevel "local" optional.  (Strictly speaking,
649    signature definitions within "local" are not legal SML.)
650    
651    Other than that: updates to INSTALL and cm/TODO.
652    
653    ----------------------------------------------------------------------
654    Name: Matthias Blume
655    Date: 2002/02/08 15:00:00 EST
656    Tag: blume-20020208-uniquepid
657    Description:
658    
659    0. Version number has been bumped to 110.38.1.  NEW BOOTFILES!!!
660    
661    1. The installer (config/install.sh) has gotten smarter:
662    
663         - Configuration options are a bit easier to specify now
664           (in config/targets).
665         - Bug in recognizing .tar.bz2 files fixed.
666         - Installer automatically resolves dependencies between
667           configuration options (e.g., if you ask for eXene, you will
668           also get cml -- regardless whether you asked for it or not).
669         - Installer can run in "quieter mode" by setting the environment
670           variable INSTALL_QUIETLY to "true".  "Quieter" does not mean
671           "completely silent", though.
672         - Build HashCons library as part of smlnj-lib.
673    
674    2. A new scheme for assigning persistent identifiers to compilation
675       units (and, by extension, to types etc.) has been put into place.
676       This fixes a long-standing bug where types and even dynamic values
677       can get internally confused, thereby compromising type safety
678       (abstraction) and dynamic correctness.  See
679    
680         http://cm.bell-labs.com/cm/cs/who/blume/pid-confusion.tgz
681    
682       for an example of how things could go wrong until now.
683    
684       The downside of the new scheme is that pids are not quite as
685       persistent as they used to be: CM will generate a fresh pid
686       for every compilation unit that it thinks it sees for the first
687       time.  That means that if you compile starting from a clean, fresh
688       source tree at two different times, you end up with different
689       binaries.
690    
691       Cutoff recompilation, however, has not been compromised because
692       CM keeps pid information in special caches between runs.
693    
694    ----------------------------------------------------------------------
695    Name: Lal George
696    Date: 2002/02/07 15:34:13 EST 2002
697    Tag: <none>
698    Description:
699    
700    Compilers that generate assembly code may produce  global labels
701    whose value is resolved at link time. The various peephole optimization
702    modules did not take this in account.
703    
704    TODO. The Labels.addrOf function should really return an option
705    type so that clients are forced to deal with this issue, rather
706    than an exception being raised.
707    
708    ----------------------------------------------------------------------
709    Name: Lal George
710    Date: 2002/02/06 13:55:02 EST
711    Tag: george-20020206-ra-breakup
712    Description:
713    
714    1. A bug fix from Allen.
715    
716        A typo causes extra fstp %st(0)'s to be generated at compensation
717        edges, which might cause stack underflow traps at runtime.  This
718        occurs in fft where there are extraneous fstps right before the 'into'
719        trap instruction (in this case they are harmless since none of the
720        integers overflow.)
721    
722    2. Pulled out various utility modules that were embedded in the modules
723       of the register allocator. I need these modules for other purposes, but
724       they are not complete enough to put into a library (just yet).
725    ----------------------------------------------------------------------
726    Name: Matthias Blume
727    Date: 2002/01/31 16:05:00 EST
728    Tag: blume-20020131-sparc-ccalls
729    Description:
730    
731    1. C-calls on Sparc needlessly allocated a huge chunk (96 bytes)
732       of extra stack space by mistake.  Fixed.
733    
734    2. Bug in logic of handling of command-line options in ml-nlffigen fixed.
735    
736    ----------------------------------------------------------------------
737    Name: Allen Leung
738    Date: 2002/01/30
739    Tag: leunga-20020130-nowhere-bug-fix
740    Description:
741    
742       MLRISC bug fixes:
743       1. Fixed a bindings computation bug in the 'nowhere' program generator tool.
744       2. MachineInt.fromString was negating its value.
745    
746    ----------------------------------------------------------------------
747    Name: Matthias Blume
748    Date: 2002/01/29
749    Tag: blume-20020129-INSTALL
750    Description:
751    
752    - Added somewhat detailed installation instructions (file INSTALL).
753    - Fixed curl-detection bug in config/install.sh.
754    - It is now possible to select the URL getter using the URLGETTER
755      environment variable:
756    
757          not set / "unknown"      --> automatic detection (script tries wget,
758                                       curl, and lynx)
759          "wget" / "curl" / "lynx" --> use the specified program (script "knows"
760                                       how to properly invoke them)
761          other                    --> use $URLGETTER directly, it must take
762                                       precisely two command-line arguments
763                                       (source URL and destination file name)
764    
765    ----------------------------------------------------------------------
766    Name: Matthias Blume
767    Date: 2002/01/28
768    Tag: blume-20020128-sparc-ccalls
769    Description:
770    
771    - Fixed problem with calculation of "used" registers in sparc-c-calls.
772    - Make use of the allocParam argument in sparc-c-calls.
773    
774    ----------------------------------------------------------------------
775    Name: Matthias Blume
776    Date: 2002/01/28
777    Tag: blume-20020128-allocParam
778    Description:
779    
780    John Reppy:  Changes c-calls API to accept client-callback for
781    allocating extra stack space.
782    me: Corresponding changes to mlriscGen (using a dummy argument that
783        does not change the current behavior).
784    
785    ----------------------------------------------------------------------
786    Name: Matthias Blume
787    Date: 2002/01/28 12:00:00
788    Tag: Release_110_38
789    Description:
790    
791    This time for real!!!
792    
793    ----------------------------------------------------------------------
794    Name: Matthias Blume
795    Date: 2002/01/28 10:56:00 EST
796    Tag: blume-20020128-retraction
797    Description:
798    
799    0. Retracted earlier 110.38.  (The Release_110_38 tag has been replaced
800       with blume-Release_110_38-retracted.)
801    
802    1. Fixed a problem with incorrect rounding modes in real64.sml.
803       (Thanks to Andrew Mccreight <andrew.mccreight@yale.edu>.)
804    
805    2. A bug in ml-nlffigen related to the handling of unnamed structs, unions,
806       and enums fixed.  The naming of corresponding ML identifiers should
807       now be consistent again.
808    
809    ----------------------------------------------------------------------
810    Name: Allen Leung
811    Date: 2002/01/27
812    Tag: leunga-20020127-nowhere
813    Description:
814    
815       Added a target called nowhere in the configuration scripts.
816       Enabling this will build the MLRISC 'nowhere' tool (for translating
817       programs with where-clauses into legal SML code) during installation.
818    
819    ----------------------------------------------------------------------
820    Name: Matthias Blume
821    Date: 2002/01/25 21:27:00 EST
822    Tag: blume-Release_110_38-retracted
823    Description:
824    
825    Call it a (working) release!  Version is 110.38. Bootfiles are ready.
826    
827    README will be added later.
828    
829    !!! NOTE:  Re-tagged as blume-Release_110_38-retracted. Original tag
830    (Release_110_38) removed.  Reason: Last-minute bug fixes.
831    
832    ----------------------------------------------------------------------
833    Name: Matthias Blume
834    Date: 2002/01/25
835    Tag: blume-20020125-ffi
836    Description:
837    
838    A large number of tweaks and improvements to ml-nlffi-lib and
839    ml-nlffigen:
840    
841       - ML represenation types have been streamlined
842       - getter and setter functions work with concrete values, not abstract
843         ones where possible
844       - ml-nlffigen command line more flexible (see README file there)
845       - some bugs have been fixed (hopefully)
846    
847    ----------------------------------------------------------------------
848    Name: Lal George
849    Date: 2002/01/24
850    Tag: george-20020124-risc-ra-interface
851    Description:
852    
853       There is a dramatic simplification in the interface to the
854       register allocator for RISC architectures as a result of making
855       parallel copy instructions explicit.
856    
857    ----------------------------------------------------------------------
858    Name: Matthias Blume
859    Date: 2002/01/22
860    Tag: blume-20020122-x86-ccalls
861    Description:
862    
863    Bug fix for c-calls on x86 (having to do with how char- and
864    short-arguments are being handled).
865    
866    ----------------------------------------------------------------------
867    Name: Matthias Blume
868    Date: 2002/01/21
869    Tag: blume-20020121-ff
870    Description:
871    
872    Another day of fiddling with the FFI...
873    
874    1. Bug fix/workaround:  CKIT does not complain about negative array
875       dimensions, so ml-nlffigen has to guard itself against this possibility.
876       (Otherwise a negative dimension would send it into an infinite loop.)
877    
878    2. Some of the abstract types (light objects, light pointers, most "base"
879       types) in structure C are now eqtypes.
880    
881    3. Added constructors and test functions for NULL function pointers.
882    
883    ----------------------------------------------------------------------
884    Name: Matthias Blume
885    Date: 2002/01/18
886    Tag: blume-20020118-ready-for-new-release
887    Description:
888    
889    Made config/srcarchiveurl point to a new place.  (Will provide boot
890    files shortly.)
891    
892    Maybe we christen this to be 110.38?
893    
894    ----------------------------------------------------------------------
895    Name: Matthias Blume
896    Date: 2002/01/18
897    Tag: blume-20020118-more-ffifiddle
898    Description:
899    
900    Today's FFI fiddling:
901    
902      - Provided a structure CGetSet with "convenient" versions of C.Get.* and
903        C.Set.* that use concrete (MLRep.*) arguments and results instead
904        of abstract ones.
905    
906      - Provided word-style bit operations etc. for "int" representation
907        types in MLRep.S<Foo>Bitops where <Foo> ranges over Char, Int, Short,
908        and Long.
909    
910    ----------------------------------------------------------------------
911    Name: Matthias Blume
912    Date: 2002/01/18
913    Tag: blume-20020118-use-x86-fp
914    Description:
915    
916    Now that x86-fast-fp seems to be working, I turned it back on again
917    by default.  (Seems to work fine now, even with the FFI.)
918    
919    Other than that, I added some documentation about the FFI to
920    src/ml-nlffigen/README and updated the FFI test examples in
921    src/ml-nlffi-lib/Tests/*.
922    
923    ----------------------------------------------------------------------
924    Name: Allen Leung
925    Date: 2002/01/17
926    Tag: leunga-20020117-x86-fast-fp-call
927    Description:
928    
929       1. Fixed a problem with handling return fp values when x86's fast fp
930          mode is turned on.
931    
932       2. Minor pretty printing fix for cellset.  Print %st(0) as %st(0) instead
933          of %f32.
934    
935       3. Added a constructor INT32lit to the ast of MLRISC tools.
936    
937    ----------------------------------------------------------------------
938    Name: Matthias Blume
939    Date: 2002/01/16
940    Tag: blume-20020116-ffifiddle
941    Description:
942    
943    More fiddling with the FFI interface:
944    
945     - Make constness 'c instead of rw wherever possible.  This eliminates
946       the need for certain explicit coercions.  (However, due to ML's
947       value polymorphism, there will still be many cases where explicit
948       coercions are necessary.  Phantom types are not the whole answer
949       to modeling a subtyping relationship in ML.)
950    
951     - ro/rw coersions for pointers added.  (Avoids the detour through */&.)
952    
953     - "printf" test example added to src/ml-nlffi-lib/Tests.  (Demonstrates
954       clumsy workaround for varargs problem.)
955    
956    ----------------------------------------------------------------------
957    Name: Lal George
958    Date: 2002/01/15
959    Tag: <none>
960    Description:
961    
962    1. Since COPY instructions are no longer native to the architecture,
963       a generic functor can be used to implement the expandCopies function.
964    
965    2. Allowed EXPORT and IMPORT pseudo-op declarations to appear inside a
966       TEXT segment.
967    
968    ----------------------------------------------------------------------
969    Name: Matthias Blume
970    Date: 2002/01/15
971    Tag: blume-20020115-ffiupdates
972    Description:
973    
974    1. Fix for bug resulting in single-precision float values being returned
975       incorrectly from FFI calls.
976    
977    2. Small modifications to C FFI API:
978    
979        - memory-allocation routines return straight objects (no options)
980          and raise an exception in out-of-memory situations
981        - unsafe extensions to cast between function pointers and pointers
982          from/to ints
983        - added structure C_Debug as an alternative to structure C where
984          pointer-dereferencing (|*| and |*!) always check for null-pointers
985        - added open_lib' to DynLinkage;  open_lib' works like open_lib
986          but also takes a (possibly empty) list of existing library handles
987          that the current library depends on
988    
989    ----------------------------------------------------------------------
990    Name: Matthias Blume
991    Date: 2002/01/10
992    Tag: blume-20020110-newffigen
993    Description:
994    
995    1. Updates to portable graph code.
996    
997    2. Major update to ml-nlffigen and ml-nlffi-lib.  Things are much
998       more scalable now so that even huge interfaces such as the one
999       for GTK compile in finite time and space. :-)
1000       See src/ml-nlffigen/README for details on what's new.
1001    
1002    ----------------------------------------------------------------------
1003    Name: Lal George
1004    Date: 2001/01/09 14:31:35 EST 2002
1005    Tag: george-20011206-rm-native-copy
1006    Description:
1007    
1008            Removed the native COPY and FCOPY instructions
1009            from all the architectures and replaced it with the
1010            explicit COPY instruction from the previous commit.
1011    
1012            It is now possible to simplify many of the optimizations
1013            modules that manipulate copies. This has not been
1014            done in this change.
1015    
1016    ----------------------------------------------------------------------
1017    Name: Lal George
1018    Date: 2001/12/06 16:50:13 EST 2001
1019    Tag: george-20011206-mlrisc-instruction
1020    Description:
1021    
1022    Changed the representation of instructions from being fully abstract
1023    to being partially concrete. That is to say:
1024    
1025      from
1026            type instruction
1027    
1028      to
1029            type instr                              (* machine instruction *)
1030    
1031            datatype instruction =
1032                LIVE of {regs: C.cellset, spilled: C.cellset}
1033              | KILL of {regs: C.cellset, spilled: C.cellset}
1034              | COPYXXX of {k: CB.cellkind, dst: CB.cell list, src: CB.cell list}
1035              | ANNOTATION of {i: instruction, a: Annotations.annotation}
1036              | INSTR of instr
1037    
1038    This makes the handling of certain special instructions that appear on
1039    all architectures easier and uniform.
1040    
1041    LIVE and KILL say that a list of registers are live or killed at the
1042    program point where they appear. No spill code is generated when an
1043    element of the 'regs' field is spilled, but the register is moved to
1044    the 'spilled' (which is present, more for debugging than anything else).
1045    
1046    LIVE replaces the (now deprecated) DEFFREG instruction on the alpha.
1047    We used to generate:
1048    
1049            DEFFREG f1
1050            f1 := f2 + f3
1051            trapb
1052    
1053    but now generate:
1054    
1055            f1 := f2 + f3
1056            trapb
1057            LIVE {regs=[f1,f2,f3], spilled=[]}
1058    
1059    Furthermore, the DEFFREG (hack) required that all floating point instruction
1060    use all registers mentioned in the instruction. Therefore f1 := f2 + f3,
1061    defines f1 and uses [f1,f2,f3]! This hack is no longer required resulting
1062    in a cleaner alpha implementation. (Hopefully, intel will not get rid of
1063    this architecture).
1064    
1065    COPYXXX is intended to replace the parallel COPY and FCOPY  available on
1066    all the architectures. This will result in further simplification of the
1067    register allocator that must be aware of them for coalescing purposes, and
1068    will also simplify certain aspects of the machine description that provides
1069    callbacks related to parallel copies.
1070    
1071    ANNOTATION should be obvious, and now INSTR represents the honest to God
1072    machine instruction set!
1073    
1074    The <arch>/instructions/<arch>Instr.sml files define certain utility
1075    functions for making porting easier -- essentially converting upper case
1076    to lower case. All machine instructions (of type instr) are in upper case,
1077    and the lower case form generates an MLRISC instruction. For example on
1078    the alpha we have:
1079    
1080      datatype instr =
1081         LDA of {r:cell, b:cell, d:operand}
1082       | ...
1083    
1084      val lda : {r:cell, b:cell, d:operand} -> instruction
1085        ...
1086    
1087    where lda is just (INSTR o LDA), etc.
1088    
1089    ----------------------------------------------------------------------
1090    Name: Matthias Blume
1091    Date: 2001/11/22 21:40:00 EST
1092    Tag: Release_110_37
1093    Description:
1094    
1095    Release 110.37.  This time for real.
1096    
1097    ----------------------------------------------------------------------
1098    Name: Matthias Blume
1099    Date: 2001/11/21 16:35:00 EST
1100    Tag: blume-20011121-foot-in-mouth
1101    Description:
1102    
1103    Removed the "Release_110_37" tag because of a serious bug.
1104    This will be re-tagged once the bug is fixed.
1105    
1106    ----------------------------------------------------------------------
1107    Name: Matthias Blume
1108    Date: 2001/11/21 16:14:00 EST
1109    Tag: blume-20011121-forgottenfile
1110    Description:
1111    
1112    Forgot to add a file.  (Just a .tex-file -- part of
1113    the CM manual source.)
1114    
1115    ----------------------------------------------------------------------
1116    Name: Matthias Blume
1117    Date: 2001/11/21 16:10:00 EST
1118    Tag: blume-20011121-invalid_110_37
1119    Description:
1120    
1121    Note: I removed the original tag "Release_110_37" from this commit
1122          because we found a serious bug in all non-x86 backends.
1123          - Matthias
1124    
1125    1. Modifications to the SML/NJ code generator and to the runtime system
1126       so that code object name strings are directly inserted into code
1127       objects at code generation time.  The only business the runtime system
1128       has with this is now to read the name strings on occasions.
1129       (The encoding of the name string has also changed somewhat.)
1130    
1131    2. CM now implements a simple "set calculus" for specifying export lists.
1132       In particular, it is now possible to refer to the export lists of
1133       other libraries/groups/sources and form unions as well as differences.
1134       See the latest CM manual for details.
1135    
1136    3. An separate notion of "proxy" libraries has again be eliminated from
1137       CM's model.  (Proxy libraries are now simply a special case of using
1138       the export list calculus.)
1139    
1140    4. Some of the existing libraries now take advantage of the new set
1141       calculus.
1142       (Notice that not all libraries have been converted because some
1143       of the existing .cm-files are supposed to be backward compatible
1144       with 110.0.x.)
1145    
1146    5. Some cleanup in stand-alone programs.  (Don't use "exnMessage" -- use
1147       "General.exnMessage"!  The former relies on a certain hook to be
1148       initialized, and that often does not happen in the stand-alone case.)
1149    
1150    ----------------------------------------------------------------------
1151    Name: Lal George
1152    Date: 2001/11/21  13:56:18 EST
1153    Tag: george-2001121-pseudo-ops
1154    Description:
1155    
1156      Implemented a complete redesign of MLRISC pseudo-ops. Now there
1157      ought to never be any question of incompatabilities with
1158      pseudo-op syntax expected by host assemblers.
1159    
1160      For now, only modules supporting GAS syntax are implemented
1161      but more should follow, such as MASM, and vendor assembler
1162      syntax, e.g. IBM as, Sun as, etc.
1163    
1164    ----------------------------------------------------------------------
1165    Name: Matthias Blume
1166    Date: 2001/11/14 11:52:00 EST
1167    Tag: blume-20011114-srcname
1168    Description:
1169    
1170    1. Routed the name of the current source file to mlriscgen where it
1171       should be directly emitted into the code object.  (This last part
1172       is yet to be done.)
1173    
1174    2. Some cleanup of the pgraph code to make it match the proposal that
1175       I put out the other day.  (The proposal notwithstanding, things are
1176       still in flux here.)
1177    
1178    ----------------------------------------------------------------------
1179    Name: Lal George
1180    Date: 2001/11/14 09:44:04 EST
1181    Tag:
1182    Description:
1183    
1184      Fix for a backpatching bug reported by Allen.
1185    
1186      Because the boundary between short and long span-dependent
1187      instructions is +/- 128, there are an astounding number of
1188      span-dependent instructions whose size is over estimated.
1189    
1190      Allen came up with the idea of letting the size of span
1191      dependent instructions be non-monotonic, for a maxIter
1192      number of times, after which the size must be monotonically
1193      increasing.
1194    
1195      This table shows the number of span-dependent instructions
1196      whose size was over-estimated as a function of maxIter, for the
1197      file Parse/parse/ml.grm.sml:
1198    
1199         maxIter            # of instructions:
1200            10                      687
1201            20                      438
1202            30                      198
1203            40                        0
1204    
1205      In compiling the compiler, there is no significant difference in
1206      compilation speed between maxIter=10 and maxIter=40. Actually,
1207      my measurements showed that maxIter=40 was a tad faster than
1208      maxIter=10! Also 96% of the  files in the compiler reach a fix
1209      point within 13 iterations, so fixing maxIter at 40, while high,
1210      is okay.
1211    
1212    ----------------------------------------------------------------------
1213    Name: Matthias Blume
1214    Date: 2001/10/31 15:25:00 EST
1215    Tag: blume-20011031-pgraph
1216    Description:
1217    
1218    CKIT:
1219    * Changed the "Function" constructor of type Ast.ctype to carry optional
1220      argument identifiers.
1221    * Changed the return type of TypeUtil.getFunction accordingly.
1222    * Type equality ignores the argument names.
1223    * TypeUtil.composite tries to preserve argument names but gives up quickly
1224      if there is a mismatch.
1225    
1226    installation script:
1227    * attempts to use "curl" if available (unless "wget" is available as well)
1228    
1229    CM:
1230    * has an experimental implementation of "portable graphs" which I will
1231      soon propose as an implementation-independent library format
1232    * there are also new libraries $/pgraph.cm and $/pgraph-util.cm
1233    
1234    NLFFI-LIB:
1235    * some cleanup (all cosmetic)
1236    
1237    NLFFIGEN:
1238    * temporarily disabled the mechanism that suppresses ML output for
1239      C definitions whose identifiers start with an underscore character
1240    * generate val bindings for enum constants
1241    * user can request that only one style (light or heavy) is being used;
1242      default is to use both (command-line arguments: -heavy and -light)
1243    * fixed bug in handling of function types involving incomplete pointers
1244    * generate ML entry points that take record arguments (i.e., using
1245      named arguments) for C functions that have a prototype with named
1246      arguments
1247      (see changes to CKIT)
1248    
1249    ----------------------------------------------------------------------
1250    Name: Allen Leung
1251    Date: 2001/10/27 20:34:00 EDT
1252    Tag: leunga-20011027-x86-fast-fp-call
1253    Description:
1254    
1255       Fixed the bug described in blume-20010920-slowfp.
1256    
1257       The fix involves
1258          1. generating FCOPYs in FSTP in ia32-svid
1259          2. marking a CALL with the appropriate annotation
1260    
1261    ----------------------------------------------------------------------
1262    Name: Matthias Blume
1263    Date: 2001/10/16 11:32:00 EDT
1264    Tag: blume-20011016-netbsd
1265    Description:
1266    
1267    Underscore patch from Chris Richards (fixing problem with compiling
1268    runtime system under recent NetBSD).
1269    
1270    ----------------------------------------------------------------------
1271    Name: Allen Leung
1272    Date: 2001/10/12 17:18:32 EDT 2001
1273    Tag: leung-20011012-x86-printflowgraph
1274    Description:
1275    
1276    X86RA now uses a valid (instead of dummy) PrintFlowgraph module.
1277    
1278    ----------------------------------------------------------------------
1279    Name: Lal George
1280    Date: 2001/10/11 23:51:34 EDT
1281    Tag: george-20011011-too-many-instrs
1282    Description:
1283    
1284    The representation of a program point never expected to see more
1285    than 65536 instructions in a basic block!
1286    
1287    ----------------------------------------------------------------------
1288    Name: Lal George
1289    Date: 2001/10/09 09:41:37 EDT
1290    Tag: george-20011008-mlrisc-labels
1291    Description:
1292    
1293    Changed the machine description files to support printing of
1294    local and global labels in assembly code, based on host assembler
1295    conventions.
1296    
1297    ----------------------------------------------------------------------
1298    Name: Matthias Blume
1299    Date: 2001/09/25 15:25:00 EDT
1300    Tag: blume-20010925-exninfo
1301    Description:
1302    
1303    I provided a non-hook implementation of exnName (at the toplevel) and
1304    made the "dummy" implementation of exnMessage (at the toplevel) more
1305    useful: if nothing gets "hooked in", then at least you are going to
1306    see the exception name and a message indicating why you don't see more.
1307    
1308    [For the time being, programs that need exnMessage and want to use
1309    ml-build should either use General.exnMessage (strongly recommended) or
1310    refer to structure General at some other point so that CM sees a
1311    static dependency.]
1312    
1313    [Similar remarks go for "print" and "use":  If you want to use their
1314    functionality in stand-alone programs generated by ml-build, then use
1315    TextIO.output and Backend.Interact.useFile (from $smlnj/compiler.cm).]
1316    
1317    ----------------------------------------------------------------------
1318    Name: Matthias Blume
1319    Date: 2001/09/20 17:28:00 EDT
1320    Tag: blume-20010920-slowfp
1321    Description:
1322    
1323    Allen says that x86-fast-fp is not safe yet, so I turned it off again...
1324    
1325    ----------------------------------------------------------------------
1326    Name: Matthias Blume
1327    Date: 2001/09/20 17:20:00 EDT
1328    Tag: blume-20010920-canonicalpaths
1329    Description:
1330    
1331    0. Updated the BOOT file (something that I forgot to do earlier).
1332    
1333    1. Small internal change to CM so that it avoids "/../" in filenames
1334       as much as possible (but only where it is safe).
1335    
1336    2. Changed config/_run-sml (resulting in a changed bin/.run-sml) so
1337       that arguments that contain delimiters are passed through correctly.
1338       This change also means that all "special" arguments of the form
1339       @SMLxxx... must come first.
1340    
1341    3. Changed install script to put relative anchor names for tool commands
1342       into pathconfig.
1343    
1344    ----------------------------------------------------------------------
1345    Name: Matthias Blume
1346    Date: 2001/09/18 15:35:00 EDT
1347    Tag: blume-20010918-readme11036
1348    Description:
1349    
1350    Added README files.
1351    
1352    ----------------------------------------------------------------------
1353    Name: Matthias Blume
1354    Date: 2001/09/18 11:45:00 EDT
1355    Tag: Release_110_36 (retag)
1356    Description:
1357    
1358    Fixed mistake in config/preloads. Retagged as 110.36.
1359    
1360    ----------------------------------------------------------------------
1361    Name: Matthias Blume
1362    Date: 2001/09/18 09:40:00 EDT
1363    Tag: Release_110_36_orig (tag changed)
1364    Description:
1365    
1366    New version (110.36).  New bootfiles.
1367    
1368    ----------------------------------------------------------------------
1369    Name: Matthias Blume
1370    Date: 2001/09/14 16:15:00 EDT
1371    Tag: blume-20010914-x86fastfp
1372    Description:
1373    
1374    John committed some changes that Allen made, in particular a (hopefully)
1375    correctly working version of the x86-fp module.
1376    
1377    I changed the default setting of the Control.MLRISC.getFlag "x86-fast-fp"
1378    flag to "true".  Everything seems to compile to a fixpoint ok, and
1379    "mandelbrot" speeds up by about 15%.
1380    
1381    ----------------------------------------------------------------------
1382    Name: Matthias Blume
1383    Date: 2001/09/13 11:20:00 EDT
1384    Tag: blume-20010913-minimal
1385    Description:
1386    
1387    1. Stefan Monnier's patch to fix a miscompilation problem that
1388       was brought to light by John Reppy's work on Moby.
1389    
1390    2. Implemented a minimal "structure Compiler" that contains just
1391       "version" and "architecture".  The minimal version will be
1392       available when the full version is not.  This is for backward-
1393       compatibility with code that wants to test Compiler.version.
1394    
1395    ----------------------------------------------------------------------
1396    Name: Matthias Blume
1397    Date: 2001/08/28 14:03:00 EDT
1398    Tag: blume-20010828-ml-lex
1399    Description:
1400    
1401    Fix for bug 1581, received from Neophytos Michael.
1402    
1403    ----------------------------------------------------------------------
1404    Name: Matthias Blume
1405    Date: 2001/08/27 11:20:00 EDT
1406    Tag: blume-20010827-readme11035
1407    Description:
1408    
1409    Fleshed out the README file for 110.35.
1410    
1411    ----------------------------------------------------------------------
1412    Name: Matthias Blume
1413    Date: 2001/08/24 17:10:00 EDT
1414    Tag: Release_110_35
1415    Description:
1416    
1417    New version number (110.35).  New bootfiles.
1418    
1419    ----------------------------------------------------------------------
1420  Name: Lal George  Name: Lal George
1421  Date: 2001/08/24 13:47:18 EDT 2001  Date: 2001/08/24 13:47:18 EDT 2001
1422  Tag: george-20010824-MLRISC-graphs  Tag: george-20010824-MLRISC-graphs
# Line 2915  Line 4319 
4319       elaborator). There were a lot of changes during my "linkpath" trials       elaborator). There were a lot of changes during my "linkpath" trials
4320       that could have been reverted to their original state but weren't.       that could have been reverted to their original state but weren't.
4321       Please, don't be too harsh on me for messing with this code a bit more       Please, don't be too harsh on me for messing with this code a bit more
4322       than what was strictly necessary...  (I _did_ resist the tempation       than what was strictly necessary...  (I _did_ resist the temptation
4323       of doing any "global reformatting" to avoid an untimely death at       of doing any "global reformatting" to avoid an untimely death at
4324       Dave's hands. :)       Dave's hands. :)
4325    

Legend:
Removed from v.915  
changed lines
  Added in v.1132

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