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

SCM Repository

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

Diff of /sml/trunk/HISTORY

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

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

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

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