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

Legend:
Removed from v.939  
changed lines
  Added in v.1145

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