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 1034, Thu Jan 24 05:53:53 2002 UTC revision 1158, Fri Mar 22 01:21:25 2002 UTC
# Line 13  Line 13 
13  Description:  Description:
14    
15  ----------------------------------------------------------------------  ----------------------------------------------------------------------
16    Name: Allen Leung
17    Date: 2002/03/21 20:30:00 EST
18    Tag: leunga-20020321-cfg
19    Description:
20    
21      Fixed a potential problem in cfg edge splitting.
22    
23    ----------------------------------------------------------------------
24    Name: Allen Leung
25    Date: 2002/03/21 17:15:00 EST
26    Tag: leunga-20020321-x86-fp-cfg
27    Description:
28    
29      1. Recoded the buggy parts of x86-fp.
30    
31         a. All the block reordering code has been removed.
32            We now depend on the block placement phases to do this work.
33    
34         b. Critical edge splitting code has been simplified and moved into the
35            CFG modules, as where they belong.
36    
37         Both of these were quite buggy and complex.  The code is now much, much
38         simpler.
39    
40      2. X86 backend.
41    
42         a. Added instructions for 64-bit support.  Instruction selection for
43            64-bit has not been committed, however, since that
44            requires changes to MLTREE which haven't been approved by
45            Lal and John.
46    
47         b. Added support for FUCOMI and FUCOMIP when generating code for
48            PentiumPro and above.  We only generate these instructions in
49            the fast-fp mode.
50    
51         c. Added cases for JP and JNP in X86FreqProps.
52    
53      3. CFG
54    
55         CFG now has a bunch of methods for edge splitting and merging.
56    
57      4. Machine description.
58    
59         John's simplification of MLTREE_BASIS.fcond broke a few machine
60         description things:
61    
62         rtl-build.{sig,sml} and hppa.mdl fixed.
63    
64         NOTE: the machine description stuff in the repository is still broken.
65               Again, I can't put my fixes in because that involves
66               changes to MLTREE.
67    
68    ----------------------------------------------------------------------
69    Name: Matthias Blume
70    Date: 2002/03/20 15:55:00 EST
71    Tag: blume-20020320-kmp
72    Description:
73    
74    Implemented Knuth-Morris-Pratt string matching in PreString and used
75    it for String.isSubstring, Substring.isSubstring, and
76    Substring.position.
77    
78    (Might need some stress-testing.  Simple examples worked fine.)
79    
80    ----------------------------------------------------------------------
81    Name: Matthias Blume
82    Date: 2002/03/19 16:37:00 EST
83    Tag: blume-20020319-witnesses
84    Description:
85    
86    Added a structure C.W and functions convert/Ptr.convert to ml-nlffi-lib.
87    
88    This implements a generic mechanism for changing constness qualifiers
89    anywhere within big C types without resorting to outright "casts".
90    (So far, functions such as C.rw/C.ro or C.Ptr.rw/C.Ptr.ro only let you
91    modify the constness at the outermost level.)
92    The implementation of "convert" is based on the idea of "witness"
93    values -- values that are not used by the operation but whose types
94    "testify" to their applicability.  On the implementation side, "convert"
95    is simply a projection (returning its second curried argument).  With
96    cross-module inlining, it should not result in any machine code being
97    generated.
98    
99    ----------------------------------------------------------------------
100    Name: Matthias Blume
101    Date: 2002/03/15 16:40:00 EST
102    Tag: blume-20020315-basis
103    Description:
104    
105    Provided (preliminary?) implementations for
106    
107      {String,Substring}.{concatWith,isSuffix,isSubstring}
108    
109    and
110    
111      Substring.full
112    
113    Those are in the Basis spec but they were missing in SML/NJ.
114    
115    ----------------------------------------------------------------------
116    Name: Matthias Blume
117    Date: 2002/03/14 21:30:00 EST
118    Tag: blume-20020314-controls
119    Description:
120    
121    Controls:
122    ---------
123    
124    1. Factored out the recently-added Controls : CONTROLS stuff and put
125       it into its own library $/controls-lib.cm.  The source tree for
126       this is under src/smlnj-lib/Controls.
127    
128    2. Changed the names of types and functions in this interface, so they
129       make a bit more "sense":
130    
131          module -> registry
132          'a registry -> 'a group
133    
134    3. The interface now deals in ref cells only.  The getter/setter interface
135       is (mostly) gone.
136    
137    4. Added a function that lets one register an already-existing ref cell.
138    
139    5. Made the corresponding modifications to the rest of the code so that
140       everything compiles again.
141    
142    6. Changed the implementation of Controls.MLRISC back to something closer
143       to the original.  In particular, this module (and therefore MLRISC)
144       does not depend on Controls.  There now is some link-time code in
145       int-sys.sml that registers the MLRISC controls with the Controls
146       module.
147    
148    CM:
149    ---
150    
151      * One can now specify the lambda-split aggressiveness in init.cmi.
152    
153    ----------------------------------------------------------------------
154    Name: Allen Leung
155    Date: 2002/03/13 17:30:00 EST
156    Tag: leunga-20020313-x86-fp-unary
157    Description:
158    
159    Bug fix for:
160    
161    > leunga@weaselbane:~/Yale/tmp/sml-dist{21} bin/sml
162    > Standard ML of New Jersey v110.39.1 [FLINT v1.5], March 08, 2002
163    > - fun f(x,(y,z)) = Real.~ y;
164    > [autoloading]
165    > [autoloading done]
166    >       fchsl   (%eax), 184(%esp)
167    > Error: MLRisc bug: X86MCEmitter.emitInstr
168    >
169    > uncaught exception Error
170    >   raised at: ../MLRISC/control/mlriscErrormsg.sml:16.14-16.19
171    
172    The problem was that the code generator did not generate any fp registers
173    in this case, and the ra didn't know that it needed to run the X86FP phase to
174    translate the pseudo fp instruction.   This only happened with unary fp
175    operators in certain situations.
176    
177    ----------------------------------------------------------------------
178    Name: Matthias Blume
179    Date: 2002/03/13 14:00:00 EST
180    Tag: blume-20020313-overload-etc
181    Description:
182    
183    1. Added _overload as a synonym for overload for backward compatibility.
184       (Control.overloadKW must be true for either version to be accepted.)
185    
186    2. Fixed bug in install script that caused more things to be installed
187       than what was requested in config/targets.
188    
189    3. Made CM aware of the (_)overload construct so that autoloading
190       works.
191    
192    ----------------------------------------------------------------------
193    Name: Matthias Blume
194    Date: 2002/03/12 22:03:00 EST
195    Tag: blume-20020312-url
196    Description:
197    
198    Forgot to update BOOT and srcarchiveurl.
199    
200    ----------------------------------------------------------------------
201    Name: Matthias Blume
202    Date: 2002/03/12 17:30:00 EST
203    Tag: blume-20020312-version110392
204    Description:
205    
206    Yet another version number bump (because of small changes to the
207    binfile format).  Version number is now 110.39.2.  NEW BOOTFILES!
208    
209    Changes:
210    
211      The new pid generation scheme described a few weeks ago was overly
212      complicated.  I implemented a new mechanism that is simpler and
213      provides a bit more "stability":  Once CM has seen a compilation
214      unit, it keeps its identity constant (as long as you do not delete
215      those crucial CM/GUID/* files).  This means that when you change
216      an interface, compile, then go back to the old interface, and
217      compile again, you arrive at the original pid.
218    
219      There now also is a mechanism that instructs CM to use the plain
220      environment hash as a module's pid (effectively making its GUID
221      the empty string).  For this, "noguid" must be specified as an
222      option to the .sml file in question within its .cm file.
223      This is most useful for code that is being generated by tools such
224      as ml-nlffigen (because during development programmers tend to
225      erase the tool's entire output directory tree including CM's cached
226      GUIDs).  "noguid" is somewhat dangerous (since it can be used to locally
227      revert to the old, broken behavior of SML/NJ, but in specific cases
228      where there is no danger of interface confusion, its use is ok
229      (I think).
230    
231      ml-nlffigen by default generates "noguid" annotations.  They can be
232      turned off by specifying -guid in its command line.
233    
234    ----------------------------------------------------------------------
235    Name: Lal George
236    Date: 2002/03/12 12 14:42:36 EST
237    Tag: george-20020312-frequency-computation
238    Description:
239    
240    Integrated jump chaining and static block frequency into the
241    compiler. More details and numbers later.
242    
243    ----------------------------------------------------------------------
244    Name: Lal George
245    Date: 2002/03/11 11 22:38:53 EST
246    Tag: george-20020311-jump-chain-elim
247    Description:
248    
249    Tested the jump chain elimination on all architectures (except the
250    hppa).  This is on by default right now and is profitable for the
251    alpha and x86, however, it may not be profitable for the sparc and ppc
252    when compiling the compiler.
253    
254    The gc test will typically jump to a label at the end of the cluster,
255    where there is another jump to an external cluster containing the actual
256    code to invoke gc. This is to allow factoring of common gc invocation
257    sequences. That is to say, we generate:
258    
259            f:
260               testgc
261               ja   L1      % jump if above to L1
262    
263            L1:
264               jmp L2
265    
266    
267    After jump chain elimination the 'ja L1' instructions is converted to
268    'ja L2'. On the sparc and ppc, many of the 'ja L2' instructions may end
269    up being implemented in their long form (if L2 is far away) using:
270    
271            jbe     L3      % jump if below or equal to L3
272            jmp     L2
273         L3:
274            ...
275    
276    
277    For large compilation units L2  may be far away.
278    
279    
280    ----------------------------------------------------------------------
281    Name: Matthias Blume
282    Date: 2002/03/11 13:30:00 EST
283    Tag: blume-20020311-mltreeeval
284    Description:
285    
286    A functor parameter was missing.
287    
288    ----------------------------------------------------------------------
289    Name: Allen Leung
290    Date: 2002/03/11 10:30:00 EST
291    Tag: leunga-20020311-runtime-string0
292    Description:
293    
294       The representation of the empty string now points to a
295    legal null terminated C string instead of unit.  It is now possible
296    to convert an ML string into C string with InlineT.CharVector.getData.
297    This compiles into one single machine instruction.
298    
299    ----------------------------------------------------------------------
300    Name: Allen Leung
301    Date: 2002/03/10 23:55:00 EST
302    Tag: leunga-20020310-x86-call
303    Description:
304    
305       Added machine generation for CALL instruction (relative displacement mode)
306    
307    ----------------------------------------------------------------------
308    Name: Matthias Blume
309    Date: 2002/03/08 16:05:00
310    Tag: blume-20020308-entrypoints
311    Description:
312    
313    Version number bumped to 110.39.1.  NEW BOOTFILES!
314    
315    Entrypoints: non-zero offset into a code object where execution should begin.
316    
317    - Added the notion of an entrypoint to CodeObj.
318    - Added reading/writing of entrypoint info to Binfile.
319    - Made runtime system bootloader aware of entrypoints.
320    - Use the address of the label of the first function given to mlriscGen
321      as the entrypoint.  This address is currently always 0, but it will
322      not be 0 once we turn on block placement.
323    - Removed the linkage cluster code (which was The Other Way(tm) of dealing
324      with entry points) from mlriscGen.
325    
326    ----------------------------------------------------------------------
327    Name: Allen Leung
328    Date: 2002/03/07 20:45:00 EST
329    Tag: leunga-20020307-x86-cmov
330    Description:
331    
332       Bug fixes for CMOVcc on x86.
333    
334       1. Added machine code generation for CMOVcc
335       2. CMOVcc is now generated in preference over SETcc on PentiumPro or above.
336       3. CMOVcc cannot have an immediate operand as argument.
337    
338    ----------------------------------------------------------------------
339    Name: Matthias Blume
340    Date: 2002/03/07 16:15:00 EST
341    Tag: blume-20020307-controls
342    Description:
343    
344    This is a very large but mostly boring patch which makes (almost)
345    every tuneable compiler knob (i.e., pretty much everything under
346    Control.* plus a few other things) configurable via both the command
347    line and environment variables in the style CM did its configuration
348    until now.
349    
350    Try starting sml with '-h' (or, if you are brave, '-H')
351    
352    To this end, I added a structure Controls : CONTROLS to smlnj-lib.cm which
353    implements the underlying generic mechanism.
354    
355    The interface to some of the existing such facilities has changed somewhat.
356    For example, the MLRiscControl module now provides mkFoo instead of getFoo.
357    (The getFoo interface is still there for backward-compatibility, but its
358    use is deprecated.)
359    
360    The ml-build script passes -Cxxx=yyy command-line arguments through so
361    that one can now twiddle the compiler settings when using this "batch"
362    compiler.
363    
364    TODO items:
365    
366    We should go through and throw out all controls that are no longer
367    connected to anything.  Moreover, we should go through and provide
368    meaningful (and correct!) documentation strings for those controls
369    that still are connected.
370    
371    Currently, multiple calls to Controls.new are accepted (only the first
372    has any effect).  Eventually we should make sure that every control
373    is being made (via Controls.new) exactly once.  Future access can then
374    be done using Controls.acc.
375    
376    Finally, it would probably be a good idea to use the getter-setter
377    interface to controls rather than ref cells.  For the time being, both
378    styles are provided by the Controls module, but getter-setter pairs are
379    better if thread-safety is of any concern because they can be wrapped.
380    
381    *****************************************
382    
383    One bug fix: The function blockPlacement in three of the MLRISC
384    backpatch files used to be hard-wired to one of two possibilities at
385    link time (according to the value of the placementFlag).  But (I
386    think) it should rather sense the flag every time.
387    
388    *****************************************
389    
390    Other assorted changes (by other people who did not supply a HISTORY entry):
391    
392    1. the cross-module inliner now works much better (Monnier)
393    2. representation of weights, frequencies, and probabilities in MLRISC
394       changed in preparation of using those for weighted block placement
395       (Reppy, George)
396    
397    ----------------------------------------------------------------------
398    Name: Lal George
399    Date: 2002/03/07 14:44:24 EST 2002
400    Tag: george-20020307-weighted-block-placement
401    
402    Tested the weighted block placement optimization on all architectures
403    (except the hppa) using AMPL to generate the block and edge frequencies.
404    Changes were required in the machine properties to correctly
405    categorize trap instructions. There is an MLRISC flag
406    "weighted-block-placement" that can be used to enable weighted block
407    placement, but this will be ineffective without block/edge
408    frequencies (coming soon).
409    
410    
411    ----------------------------------------------------------------------
412    Name: Lal George
413    Date: 2002/03/05 17:24:48 EST
414    Tag: george-20020305-linkage-cluster
415    
416    In order to support the block placement optimization, a new cluster
417    is generated as the very first cluster (called the linkage cluster).
418    It contains a single jump to the 'real' entry point for the compilation
419    unit. Block placement has no effect on the linkage cluster itself, but
420    all the other clusters  have full freedom in the manner in which they
421    reorder blocks or functions.
422    
423    On the x86 the typical linkage code that is generated is:
424       ----------------------
425            .align 2
426       L0:
427            addl    $L1-L0, 72(%esp)
428            jmp     L1
429    
430    
431            .align  2
432       L1:
433       ----------------------
434    
435    72(%esp) is the memory location for the stdlink register. This
436    must contain the address of the CPS function being called. In the
437    above example, it contains the address of  L0; before
438    calling L1 (the real entry point for the compilation unit), it
439    must contain the address for L1, and hence
440    
441            addl $L1-L0, 72(%esp)
442    
443    I have tested this on all architectures except the hppa.The increase
444    in code size is of course negligible
445    
446    ----------------------------------------------------------------------
447    Name: Allen Leung
448    Date: 2002/03/03 13:20:00 EST
449    Tag: leunga-20020303-mlrisc-tools
450    
451      Added #[ ... ] expressions to mlrisc tools
452    
453    ----------------------------------------------------------------------
454    Name: Matthias Blume
455    Date: 2002/02/27 12:29:00 EST
456    Tag: blume-20020227-cdebug
457    Description:
458    
459    - made types in structure C and C_Debug to be equal
460    - got rid of code duplication (c-int.sml vs. c-int-debug.sml)
461    - there no longer is a C_Int_Debug (C_Debug is directly derived from C)
462    
463    ----------------------------------------------------------------------
464    Name: Matthias Blume
465    Date: 2002/02/26 12:00:00 EST
466    Tag: blume-20020226-ffi
467    Description:
468    
469    1. Fixed a minor bug in CM's "noweb" tool:
470       If numbering is turned off, then truly don't number (i.e., do not
471       supply the -L option to noweb).  The previous behavior was to supply
472       -L'' -- which caused noweb to use the "default" line numbering scheme.
473       Thanks to Chris Richards for pointing this out (and supplying the fix).
474    
475    2. Once again, I reworked some aspects of the FFI:
476    
477       A. The incomplete/complete type business:
478    
479       - Signatures POINTER_TO_INCOMPLETE_TYPE and accompanying functors are
480         gone!
481       - ML types representing an incomplete type are now *equal* to
482         ML types representing their corresponding complete types (just like
483         in C).  This is still safe because ml-nlffigen will not generate
484         RTTI for incomplete types, nor will it generate functions that
485         require access to such RTTI.   But when ML code generated from both
486         incomplete and complete versions of the C type meet, the ML types
487         are trivially interoperable.
488    
489         NOTE:  These changes restore the full generality of the translation
490         (which was previously lost when I eliminated functorization)!
491    
492       B. Enum types:
493    
494       - Structure C now has a type constructor "enum" that is similar to
495         how the "su" constructor works.  However, "enum" is not a phantom
496         type because each "T enum" has values (and is isomorphic to
497         MLRep.Signed.int).
498       - There are generic access operations for enum objects (using
499         MLRep.Signed.int).
500       - ml-nlffigen will generate a structure E_foo for each "enum foo".
501         * The structure contains the definition of type "mlrep" (the ML-side
502         representation type of the enum).  Normally, mlrep is the same
503         as "MLRep.Signed.int", but if ml-nlffigen was invoked with "-ec",
504         then mlrep will be defined as a datatype -- thus facilitating
505         pattern matching on mlrep values.
506         ("-ec" will be suppressed if there are duplicate values in an
507          enumeration.)
508         * Constructors ("-ec") or values (no "-ec") e_xxx of type mlrep
509         will be generated for each C enum constant xxx.
510         * Conversion functions m2i and i2m convert between mlrep and
511         MLRep.Signed.int.  (Without "-ec", these functions are identities.)
512         * Coversion functions c and ml convert between mlrep and "tag enum".
513         * Access functions (get/set) fetch and store mlrep values.
514       - By default (unless ml-nlffigen was invoked with "-nocollect"), unnamed
515         enumerations are merged into one single enumeration represented by
516         structure E_'.
517    
518    ----------------------------------------------------------------------
519    Name: Allen Leung
520    Date: 2002/02/25 04:45:00 EST
521    Tag: leunga-20020225-cps-spill
522    
523    This is a new implementation of the CPS spill phase.
524    The new phase is in the new file compiler/CodeGen/cpscompile/spill-new.sml
525    In case of problems, replace it with the old file spill.sml
526    
527    The current compiler runs into some serious performance problems when
528    constructing a large record.  This can happen when we try to compile a
529    structure with many items.  Even a very simple structure like the following
530    makes the compiler slow down.
531    
532        structure Foo = struct
533           val x_1 = 0w1 : Word32.int
534           val x_2 = 0w2 : Word32.int
535           val x_3 = 0w3 : Word32.int
536           ...
537           val x_N = 0wN : Word32.int
538        end
539    
540    The following table shows the compile time, from N=1000 to N=4000,
541    with the old compiler:
542    
543    N
544    1000   CPS 100 spill                           0.04u  0.00s  0.00g
545           MLRISC ra                               0.06u  0.00s  0.05g
546              (spills = 0 reloads = 0)
547           TOTAL                                   0.63u  0.07s  0.21g
548    
549    1100   CPS 100 spill                           8.25u  0.32s  0.64g
550           MLRISC ra                               5.68u  0.59s  3.93g
551              (spills = 0 reloads = 0)
552           TOTAL                                   14.71u  0.99s  4.81g
553    
554    1500   CPS 100 spill                           58.55u  2.34s  1.74g
555           MLRISC ra                               5.54u  0.65s  3.91g
556              (spills = 543 reloads = 1082)
557           TOTAL                                   65.40u  3.13s  6.00g
558    
559    2000   CPS 100 spill                           126.69u  4.84s  3.08g
560           MLRISC ra                               0.80u  0.10s  0.55g
561              (spills = 42 reloads = 84)
562           TOTAL                                   129.42u  5.10s  4.13g
563    
564    3000   CPS 100 spill                           675.59u  19.03s  11.64g
565           MLRISC ra                               2.69u  0.27s  1.38g
566              (spills = 62 reloads = 124)
567           TOTAL                                   682.48u  19.61s  13.99g
568    
569    4000   CPS 100 spill                           2362.82u  56.28s  43.60g
570           MLRISC ra                               4.96u  0.27s  2.72g
571              (spills = 85 reloads = 170)
572           TOTAL                                   2375.26u  57.21s  48.00g
573    
574    As you can see the old cps spill module suffers from some serious
575    performance problem.  But since I cannot decipher the old code fully,
576    instead of patching the problems up, I'm reimplementing it
577    with a different algorithm.  The new code is more modular,
578    smaller when compiled, and substantially faster
579    (O(n log n) time and O(n) space).  Timing of the new spill module:
580    
581    4000  CPS 100 spill                           0.02u  0.00s  0.00g
582          MLRISC ra                               0.25u  0.02s  0.15g
583             (spills=1 reloads=3)
584          TOTAL                                   7.74u  0.34s  1.62g
585    
586    Implementation details:
587    
588    As far as I can tell, the purpose of the CPS spill module is to make sure the
589    number of live variables at any program point (the bandwidth)
590    does not exceed a certain limit, which is determined by the
591    size of the spill area.
592    
593    When the bandwidth is too large, we decrease the register pressure by
594    packing live variables into spill records.  How we achieve this is
595    completely different than what we did in the old code.
596    
597    First, there is something about the MLRiscGen code generator
598    that we should be aware of:
599    
600    o MLRiscGen performs code motion!
601    
602       In particular, it will move floating point computations and
603       address computations involving only the heap pointer to
604       their use sites (if there is only a single use).
605       What this means is that if we have a CPS record construction
606       statement
607    
608           RECORD(k,vl,w,e)
609    
610       we should never count the new record address w as live if w
611       has only one use (which is often the case).
612    
613       We should do something similar to floating point, but the transformation
614       there is much more complex, so I won't deal with that.
615    
616    Secondly, there are now two new cps primops at our disposal:
617    
618     1. rawrecord of record_kind option
619        This pure operator allocates some uninitialized storage from the heap.
620        There are two forms:
621    
622         rawrecord NONE [INT n]  allocates a tagless record of length n
623         rawrecord (SOME rk) [INT n] allocates a tagged record of length n
624                                     and initializes the tag.
625    
626     2. rawupdate of cty
627          rawupdate cty (v,i,x)
628          Assigns to x to the ith component of record v.
629          The storelist is not updated.
630    
631    We use these new primops for both spilling and increment record construction.
632    
633     1. Spilling.
634    
635        This is implemented with a linear scan algorithm (but generalized
636        to trees).  The algorithm will create a single spill record at the
637        beginning of the cps function and use rawupdate to spill to it,
638        and SELECT or SELp to reload from it.  So both spills and reloads
639        are fine-grain operations.  In contrast, in the old algorithm
640        "spills" have to be bundled together in records.
641    
642        Ideally, we should sink the spill record construction to where
643        it is needed.  We can even split the spill record into multiple ones
644        at the places where they are needed.  But CPS is not a good
645        representation for global code motion, so I'll keep it simple and
646        am not attempting this.
647    
648     2. Incremental record construction (aka record splitting).
649    
650        Long records with many component values which are simulatenously live
651        (recall that single use record addresses are not considered to
652         be live) are constructed with rawrecord and rawupdate.
653        We allocate space on the heap with rawrecord first, then gradually
654        fill it in with rawupdate.  This is the technique suggested to me
655        by Matthias.
656    
657        Some restrictions on when this is applicable:
658        1. It is not a VECTOR record.  The code generator currently does not handle
659           this case. VECTOR record uses double indirection like arrays.
660        2. All the record component values are defined in the same "basic block"
661           as the record constructor.  This is to prevent speculative
662           record construction.
663    
664    ----------------------------------------------------------------------
665    Name: Allen Leung
666    Date: 2002/02/22 01:02:00 EST
667    Tag: leunga-20020222-mlrisc-tools
668    
669    Minor bug fixes in the parser and rewriter
670    
671    ----------------------------------------------------------------------
672    Name: Allen Leung
673    Date: 2002/02/21 20:20:00 EST
674    Tag: leunga-20020221-peephole
675    
676    Regenerated the peephole files.  Some contained typos in the specification
677    and some didn't compile because of pretty printing bugs in the old version
678    of 'nowhere'.
679    
680    ----------------------------------------------------------------------
681    Name: Allen Leung
682    Date: 2002/02/19 20:20:00 EST
683    Tag: leunga-20020219-mlrisc-tools
684    Description:
685    
686       Minor bug fixes to the mlrisc-tools library:
687    
688       1.  Fixed up parsing colon suffixed keywords
689       2.  Added the ability to shut the error messages up
690       3.  Reimplemented the pretty printer and fixed up/improved
691           the pretty printing of handle and -> types.
692       4.  Fixed up generation of literal symbols in the nowhere tool.
693       5.  Added some SML keywords to to sml.sty
694    
695    ----------------------------------------------------------------------
696    Name: Matthias Blume
697    Date: 2002/02/19 16:20:00 EST
698    Tag: blume-20020219-cmffi
699    Description:
700    
701    A wild mix of changes, some minor, some major:
702    
703    * All C FFI-related libraries are now anchored under $c:
704        $/c.cm      --> $c/c.cm
705        $/c-int.cm  --> $c/internals/c-int.cm
706        $/memory.cm --> $c/memory/memory.cm
707    
708    * "make" tool (in CM) now treats its argument pathname slightly
709      differently:
710        1. If the native expansion is an absolute name, then before invoking
711           the "make" command on it, CM will apply OS.Path.mkRelative
712           (with relativeTo = OS.FileSys.getDir()) to it.
713        2. The argument will be passed through to subsequent phases of CM
714           processing without "going native".  In particular, if the argument
715           was an anchored path, then "make" will not lose track of that anchor.
716    
717    * Compiler backends now "know" their respective C calling conventions
718      instead of having to be told about it by ml-nlffigen.  This relieves
719      ml-nlffigen from one of its burdens.
720    
721    * The X86Backend has been split into X86CCallBackend and X86StdCallBackend.
722    
723    * Export C_DEBUG and C_Debug from $c/c.cm.
724    
725    * C type encoding in ml-nlffi-lib has been improved to model the conceptual
726      subtyping relationship between incomplete pointers and their complete
727      counterparts.  For this, ('t, 'c) ptr has been changed to 'o ptr --
728      with the convention of instantiating 'o with ('t, 'c) obj whenever
729      the pointer target type is complete.  In the incomplete case, 'o
730      will be instantiated with some "'c iobj" -- a type obtained by
731      using one of the functors PointerToIncompleteType or PointerToCompleteType.
732    
733      Operations that work on both incomplete and complete pointer types are
734      typed as taking an 'o ptr while operations that require the target to
735      be known are typed as taking some ('t, 'c) obj ptr.
736    
737      voidptr is now a bit "more concrete", namely "type voidptr = void ptr'"
738      where void is an eqtype without any values.  This makes it possible
739      to work on voidptr values using functions meant to operate on light
740      incomplete pointers.
741    
742    * As a result of the above, signature POINTER_TO_INCOMPLETE_TYPE has
743      been vastly simplified.
744    
745    ----------------------------------------------------------------------
746    Name: Matthias Blume
747    Date: 2002/02/19 10:48:00 EST
748    Tag: blume-20020219-pqfix
749    Description:
750    
751    Applied Chris Okasaki's bug fix for priority queues.
752    
753    ----------------------------------------------------------------------
754    Name: Matthias Blume
755    Date: 2002/02/15 17:05:00
756    Tag: Release_110_39
757    Description:
758    
759    Last-minute retagging is becoming a tradition... :-(
760    
761    This is the working release 110.39.
762    
763    ----------------------------------------------------------------------
764    Name: Matthias Blume
765    Date: 2002/02/15 16:00:00 EST
766    Tag: Release_110_39-orig
767    Description:
768    
769    Working release 110.39.  New bootfiles.
770    
771    (Update: There was a small bug in the installer so it wouldn't work
772    with all shells.  So I retagged. -Matthias)
773    
774    ----------------------------------------------------------------------
775    Name: Matthias Blume
776    Date: 2002/02/15 14:17:00 EST
777    Tag: blume-20020215-showbindings
778    Description:
779    
780    Added EnvRef.listBoundSymbols and CM.State.showBindings.  Especially
781    the latter can be useful for exploring what bindings are available at
782    the interactive prompt.  (The first function returns only the list
783    of symbols that are really bound, the second prints those but also the
784    ones that CM's autoloading mechanism knows about.)
785    
786    ----------------------------------------------------------------------
787    Name: Matthias Blume
788    Date: 2002/02/15 12:08:00 EST
789    Tag: blume-20020215-iptrs
790    Description:
791    
792    Two improvements to ml-nlffigen:
793    
794      1. Write files only if they do not exist or if their current contents
795         do not coincide with what's being written.  (That is, avoid messing
796         with the time stamps unless absolutely necessary.)
797    
798      2. Implement a "repository" mechanism for generated files related
799         to "incomplete pointer types".   See the README file for details.
800    
801    ----------------------------------------------------------------------
802    Name: Matthias Blume
803    Date: 2002/02/14 11:50:00 EST
804    Tag: blume-20020214-quote
805    Description:
806    
807    Added a type 't t_' to tag.sml (in ml-nlffi-lib.cm).  This is required
808    because of the new and improved tag generation scheme.  (Thanks to Allen
809    Leung for pointing it out.)
810    
811    ----------------------------------------------------------------------
812    Name: Lal George
813    Date: 2002/02/14 09:55:27 EST 2002
814    Tag: george-20020214-isabelle-bug
815    Description:
816    
817    Fixed the MLRISC bug sent by Markus Wenzel regarding the compilation
818    of Isabelle on the x86.
819    
820    From Allen:
821    -----------
822     I've found the problem:
823    
824         in ra-core.sml, I use the counter "blocked" to keep track of the
825         true number of elements in the freeze queue.  When the counter goes
826         to zero, I skip examining the queue.  But I've messed up the
827         bookkeeping in combine():
828    
829             else ();
830             case !ucol of
831               PSEUDO => (if !cntv > 0 then
832                     (if !cntu > 0 then blocked := !blocked - 1 else ();
833                                        ^^^^^^^^^^^^^^^^^^^^^^^
834                      moveu := mergeMoveList(!movev, !moveu)
835                     )
836                  else ();
837    
838         combine() is called to coalesce two nodes u and v.
839         I think I was thinking that if the move counts of u and v are both
840         greater than zero then after they are coalesced then one node is
841         removed from the freeze queue.  Apparently I was thinking that
842         both u and v are of low degree, but that's clearly not necessarily true.
843    
844    
845    02/12/2002:
846        Here's the patch.  HOL now compiles.
847    
848        I don't know how this impact on performance (compile
849        time or runtime).  This bug caused the RA (especially on the x86)
850        to go thru the potential spill phase when there are still nodes on the
851        freeze queue.
852    
853    
854    
855    
856    ----------------------------------------------------------------------
857    Name: Matthias Blume
858    Date: 2002/02/13 22:40:00 EST
859    Tag: blume-20020213-fptr-rtti
860    Description:
861    
862    Fixed a bug in ml-nlffigen that was introduced with one of the previous
863    updates.
864    
865    ----------------------------------------------------------------------
866    Name: Matthias Blume
867    Date: 2002/02/13 16:41:00 EST
868    Tag: blume-20020213-cmlpq
869    Description:
870    
871    Added new priority queue export symbols (which have just been added to
872    smlnj-lib.cm) to CML's version of smlnj-lib.cm.  (Otherwise CML would
873    not compile and the installer would choke.)
874    
875    ----------------------------------------------------------------------
876    Name: Matthias Blume
877    Date: 2002/02/13 16:15:00 EST
878    Tag: blume-20020213-various
879    Description:
880    
881    1. More tweaks to ml-nlffigen:
882    
883       - better internal datastructures (resulting in slight speedup)
884       - "-match" option requires exact match
885       - "localized" gensym counters (untagged structs/unions nested within
886         other structs/unions or within typedefs get a fresh counter; their
887         tag will be prefixed by a concatenation of their parents' tags)
888       - bug fixes (related to calculation of transitive closure of types
889         to be included in the output)
890    
891    2. Minor Basis updates:
892    
893       - added implementations for List.collate and Option.app
894    
895    ----------------------------------------------------------------------
896    Name: Matthias Blume
897    Date: 2002/02/11 15:55:00 EST
898    Tag: blume-20020211-gensym
899    Description:
900    
901    Added a "-gensym" option to command line of ml-nlffigen.  This can be
902    used to specify a "stem" -- a string that is inserted in all "gensym'd"
903    names (ML structure names that correspond to unnamed C structs, unions,
904    and enums), so that separate runs of ml-nlffigen do not clash.
905    
906    ----------------------------------------------------------------------
907    Name: Matthias Blume
908    Date: 2002/02/11 12:05:00 EST
909    Tag: blume-20020211-gensml
910    Description:
911    
912    A quick fix for a problem with GenSML (in the pgraph-util library):
913    Make generation of toplevel "local" optional.  (Strictly speaking,
914    signature definitions within "local" are not legal SML.)
915    
916    Other than that: updates to INSTALL and cm/TODO.
917    
918    ----------------------------------------------------------------------
919    Name: Matthias Blume
920    Date: 2002/02/08 15:00:00 EST
921    Tag: blume-20020208-uniquepid
922    Description:
923    
924    0. Version number has been bumped to 110.38.1.  NEW BOOTFILES!!!
925    
926    1. The installer (config/install.sh) has gotten smarter:
927    
928         - Configuration options are a bit easier to specify now
929           (in config/targets).
930         - Bug in recognizing .tar.bz2 files fixed.
931         - Installer automatically resolves dependencies between
932           configuration options (e.g., if you ask for eXene, you will
933           also get cml -- regardless whether you asked for it or not).
934         - Installer can run in "quieter mode" by setting the environment
935           variable INSTALL_QUIETLY to "true".  "Quieter" does not mean
936           "completely silent", though.
937         - Build HashCons library as part of smlnj-lib.
938    
939    2. A new scheme for assigning persistent identifiers to compilation
940       units (and, by extension, to types etc.) has been put into place.
941       This fixes a long-standing bug where types and even dynamic values
942       can get internally confused, thereby compromising type safety
943       (abstraction) and dynamic correctness.  See
944    
945         http://cm.bell-labs.com/cm/cs/who/blume/pid-confusion.tgz
946    
947       for an example of how things could go wrong until now.
948    
949       The downside of the new scheme is that pids are not quite as
950       persistent as they used to be: CM will generate a fresh pid
951       for every compilation unit that it thinks it sees for the first
952       time.  That means that if you compile starting from a clean, fresh
953       source tree at two different times, you end up with different
954       binaries.
955    
956       Cutoff recompilation, however, has not been compromised because
957       CM keeps pid information in special caches between runs.
958    
959    ----------------------------------------------------------------------
960    Name: Lal George
961    Date: 2002/02/07 15:34:13 EST 2002
962    Tag: <none>
963    Description:
964    
965    Compilers that generate assembly code may produce  global labels
966    whose value is resolved at link time. The various peephole optimization
967    modules did not take this in account.
968    
969    TODO. The Labels.addrOf function should really return an option
970    type so that clients are forced to deal with this issue, rather
971    than an exception being raised.
972    
973    ----------------------------------------------------------------------
974    Name: Lal George
975    Date: 2002/02/06 13:55:02 EST
976    Tag: george-20020206-ra-breakup
977    Description:
978    
979    1. A bug fix from Allen.
980    
981        A typo causes extra fstp %st(0)'s to be generated at compensation
982        edges, which might cause stack underflow traps at runtime.  This
983        occurs in fft where there are extraneous fstps right before the 'into'
984        trap instruction (in this case they are harmless since none of the
985        integers overflow.)
986    
987    2. Pulled out various utility modules that were embedded in the modules
988       of the register allocator. I need these modules for other purposes, but
989       they are not complete enough to put into a library (just yet).
990    ----------------------------------------------------------------------
991    Name: Matthias Blume
992    Date: 2002/01/31 16:05:00 EST
993    Tag: blume-20020131-sparc-ccalls
994    Description:
995    
996    1. C-calls on Sparc needlessly allocated a huge chunk (96 bytes)
997       of extra stack space by mistake.  Fixed.
998    
999    2. Bug in logic of handling of command-line options in ml-nlffigen fixed.
1000    
1001    ----------------------------------------------------------------------
1002    Name: Allen Leung
1003    Date: 2002/01/30
1004    Tag: leunga-20020130-nowhere-bug-fix
1005    Description:
1006    
1007       MLRISC bug fixes:
1008       1. Fixed a bindings computation bug in the 'nowhere' program generator tool.
1009       2. MachineInt.fromString was negating its value.
1010    
1011    ----------------------------------------------------------------------
1012    Name: Matthias Blume
1013    Date: 2002/01/29
1014    Tag: blume-20020129-INSTALL
1015    Description:
1016    
1017    - Added somewhat detailed installation instructions (file INSTALL).
1018    - Fixed curl-detection bug in config/install.sh.
1019    - It is now possible to select the URL getter using the URLGETTER
1020      environment variable:
1021    
1022          not set / "unknown"      --> automatic detection (script tries wget,
1023                                       curl, and lynx)
1024          "wget" / "curl" / "lynx" --> use the specified program (script "knows"
1025                                       how to properly invoke them)
1026          other                    --> use $URLGETTER directly, it must take
1027                                       precisely two command-line arguments
1028                                       (source URL and destination file name)
1029    
1030    ----------------------------------------------------------------------
1031    Name: Matthias Blume
1032    Date: 2002/01/28
1033    Tag: blume-20020128-sparc-ccalls
1034    Description:
1035    
1036    - Fixed problem with calculation of "used" registers in sparc-c-calls.
1037    - Make use of the allocParam argument in sparc-c-calls.
1038    
1039    ----------------------------------------------------------------------
1040    Name: Matthias Blume
1041    Date: 2002/01/28
1042    Tag: blume-20020128-allocParam
1043    Description:
1044    
1045    John Reppy:  Changes c-calls API to accept client-callback for
1046    allocating extra stack space.
1047    me: Corresponding changes to mlriscGen (using a dummy argument that
1048        does not change the current behavior).
1049    
1050    ----------------------------------------------------------------------
1051    Name: Matthias Blume
1052    Date: 2002/01/28 12:00:00
1053    Tag: Release_110_38
1054    Description:
1055    
1056    This time for real!!!
1057    
1058    ----------------------------------------------------------------------
1059    Name: Matthias Blume
1060    Date: 2002/01/28 10:56:00 EST
1061    Tag: blume-20020128-retraction
1062    Description:
1063    
1064    0. Retracted earlier 110.38.  (The Release_110_38 tag has been replaced
1065       with blume-Release_110_38-retracted.)
1066    
1067    1. Fixed a problem with incorrect rounding modes in real64.sml.
1068       (Thanks to Andrew Mccreight <andrew.mccreight@yale.edu>.)
1069    
1070    2. A bug in ml-nlffigen related to the handling of unnamed structs, unions,
1071       and enums fixed.  The naming of corresponding ML identifiers should
1072       now be consistent again.
1073    
1074    ----------------------------------------------------------------------
1075    Name: Allen Leung
1076    Date: 2002/01/27
1077    Tag: leunga-20020127-nowhere
1078    Description:
1079    
1080       Added a target called nowhere in the configuration scripts.
1081       Enabling this will build the MLRISC 'nowhere' tool (for translating
1082       programs with where-clauses into legal SML code) during installation.
1083    
1084    ----------------------------------------------------------------------
1085    Name: Matthias Blume
1086    Date: 2002/01/25 21:27:00 EST
1087    Tag: blume-Release_110_38-retracted
1088    Description:
1089    
1090    Call it a (working) release!  Version is 110.38. Bootfiles are ready.
1091    
1092    README will be added later.
1093    
1094    !!! NOTE:  Re-tagged as blume-Release_110_38-retracted. Original tag
1095    (Release_110_38) removed.  Reason: Last-minute bug fixes.
1096    
1097    ----------------------------------------------------------------------
1098    Name: Matthias Blume
1099    Date: 2002/01/25
1100    Tag: blume-20020125-ffi
1101    Description:
1102    
1103    A large number of tweaks and improvements to ml-nlffi-lib and
1104    ml-nlffigen:
1105    
1106       - ML represenation types have been streamlined
1107       - getter and setter functions work with concrete values, not abstract
1108         ones where possible
1109       - ml-nlffigen command line more flexible (see README file there)
1110       - some bugs have been fixed (hopefully)
1111    
1112    ----------------------------------------------------------------------
1113  Name: Lal George  Name: Lal George
1114  Date: 2002/01/24  Date: 2002/01/24
1115  Tag: george-20020124-risc-ra-interface  Tag: george-20020124-risc-ra-interface
# Line 511  Line 1608 
1608    
1609  ----------------------------------------------------------------------  ----------------------------------------------------------------------
1610  Name: Matthias Blume  Name: Matthias Blume
 >>>>>>> 1.169  
1611  Date: 2001/09/18 15:35:00 EDT  Date: 2001/09/18 15:35:00 EDT
1612  Tag: blume-20010918-readme11036  Tag: blume-20010918-readme11036
1613  Description:  Description:

Legend:
Removed from v.1034  
changed lines
  Added in v.1158

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