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 1137, Tue Mar 12 22:28:55 2002 UTC revision 1190, Mon May 13 20:39:05 2002 UTC
# Line 11  Line 11 
11  Date: yyyy/mm/dd  Date: yyyy/mm/dd
12  Tag: <post-commit CVS tag>  Tag: <post-commit CVS tag>
13  Description:  Description:
14    
15    ----------------------------------------------------------------------
16    Name: Matthias Blume
17    Date: 2002/05/13 16:40:00 EDT
18    Tag: blume-20020513-pp-etc
19    Description:
20    
21    A few minor bugfixes:
22    
23      - Stopgap measure for bug recently reported by Elsa Gunter (ppDec).
24        (Bogus printouts for redefined bindings still occur.  Compiler
25        bug should no longer occur now.  We need to redo the prettyprinter
26        from scratch.)
27    
28      - CM pathname printer now also adds escape sequences for ( and )
29    
30      - commend and docu fixes for ml-nlffi
31    
32    ----------------------------------------------------------------------
33    Name: Matthias Blume
34    Date: 2002/05/10 16:40:00 EDT
35    Tag: blume-20020510-erg-textio
36    Description:
37    
38    Applied the following bugfix provided by Emden Gansner:
39    
40        Output is corrupted when outputSubstr is used rather than output.
41    
42        The problem occurs when a substring
43    
44            ss = (s, dataStart, dataLen)
45    
46        where dataStart > 0, fills a stream buffer with avail bytes left.
47        avail bytes of s, starting at index dataStart, are copied into the
48        buffer, the buffer is flushed, and then the remaining dataLen-avail
49        bytes of ss are copied into the beginning of the buffer. Instead of
50        starting this copy at index dataStart+avail in s, the current code
51        starts the copy at index avail.
52    
53        Fix:
54        In text-io-fn.sml, change line 695 from
55             val needsFlush = copyVec(v, avail, dataLen-avail, buf, 0)
56        to
57             val needsFlush = copyVec(v, dataStart+avail, dataLen-avail, buf, 0)
58    
59    ----------------------------------------------------------------------
60    Name: Matthias Blume
61    Date: 2002/04/12 13:55:00 EDT
62    Tag: blume-20020412-assyntax
63    Description:
64    
65    1. Grabbed newer assyntax.h from the XFree86 project.
66    2. Fiddled with how to compile X86.prim.asm without warnings.
67    3. (Very) Minor cleanup in CM.
68    
69    ----------------------------------------------------------------------
70    Name: Matthias Blume
71    Date: 2002/04/01 (no joke!) 17:07:00 EST
72    Tag: blume-20020401-x86div
73    Description:
74    
75    Added full support for div/mod/rem/quot on the x86, using the machine
76    instruction's two results (without clumsily recomputing the remainder)
77    directly where appropriate.
78    
79    Some more extensive power-of-two support was added to the x86 instruction
80    selector (avoiding expensive divs, mods, and muls where they can be
81    replaced with cheaper shifts and masks).  However, this sort of thing
82    ought to be done earlier, e.g., within the CPS optimizer so that
83    all architectures benefit from it.
84    
85    The compiler compiles to a fixed point, but changes might be somewhat
86    fragile nevertheless.  Please, report any strange things that you might
87    see wrt. div/mod/quot/rem...
88    
89    ----------------------------------------------------------------------
90    Name: Matthias Blume
91    Date: 2002/03/29 17:22:00
92    Tag: blume-20020329-div
93    Description:
94    
95    Fixed my broken div/mod logic.  Unfortunately, this means that the
96    inline code for div/mod now has one more comparison than before.
97    Fast paths (quotient > 0 or remainder = 0) are not affected, though.
98    The problem was with quotient = 0, because that alone does not tell
99    us which way the rounding went.  One then has to look at whether
100    remainder and divisor have the same sign...  :(
101    
102    Anyway, I replaced the bootfiles with fresh ones...
103    
104    ----------------------------------------------------------------------
105    Name: Matthias Blume
106    Date: 2002/03/29 14:10:00 EST
107    Tag: blume-20020329-inlprims
108    Description:
109    
110    NEW BOOTFILES!!!    Version number bumped to 110.39.3.
111    
112    Primops have changed. This means that the bin/boot-file formats have
113    changed as well.
114    
115    To make sure that there is no confusion, I made a new version.
116    
117    
118    CHANGES:
119    
120    * removed REMT from mltree (remainder should never overflow).
121    
122    * added primops to deal with divisions of all flavors to the frontend
123    
124    * handled these primops all the way through so they map to their respective
125      MLRISC support
126    
127    * used these primops in the implementation of Int, Int32, Word, Word32
128    
129    * removed INLDIV, INLMOD, and INLREM as they are no longer necessary
130    
131    * parameterized INLMIN, INLMAX, and INLABS by a numkind
132    
133    * translate.sml now deals with all flavors of INL{MIN,MAX,ABS}, including
134      floating point
135    
136    * used INL{MIN,MAX,ABS} in the implementation of Int, Int32, Word, Word32,
137      and Real (but Real.abs maps to a separate floating-point-only primop)
138    
139    
140    TODO items:
141    
142    * Hacked Alpha32 instruction selection, disabling the selection of REMx
143      instructions because the machine instruction encoder cannot handle
144      them.  (Hppa, PPC, and Sparc instruction selection did not handle
145      REM in the first place, and REM is supported by the x86 machine coder.)
146    
147    * Handle DIV and MOD with DIV_TO_NEGINF directly in the x86 instruction
148      selection phase.  (The two can be streamlined because the hardware
149      delivers both quotient and remainder at the same time anyway.)
150    
151    * Think about what to do with "valOf(Int32.minInt) div ~1" and friends.
152      (Currently the behavior is inconsistent both across architectures and
153      wrt. the draft Basis spec.)
154    
155    * Word8 should eventually be handled natively, too.
156    
157    * There seems to be one serious bug in mltree-gen.sml.  It appears, though,
158      as if there currently is no execution path that could trigger it in
159      SML/NJ.  (The assumptions underlying functions arith and promotable do not
160      hold for things like multiplication and division.)
161    
162    ----------------------------------------------------------------------
163    Name: Matthias Blume
164    Date: 2002/03/27 16:27:00 EST
165    Tag: blume-20020327-mlrisc-divisions
166    Description:
167    
168    Added support for all four division operations (ML's div, mod, quot,
169    and rem) to MLRISC.  In the course of doing so, I also rationalized
170    the naming (no more annoying switch-around of DIV and QUOT), by
171    parameterizing the operation by div_rounding_mode (which can be either
172    DIV_TO_ZERO or DIV_TO_NEGINF).
173    
174    The generic MLTreeGen functor takes care of compiling all four
175    operations down to only round-to-zero div.
176    
177    Missing pieces:
178    
179      * Doing something smarter than relying on MLTreeGen on architectures
180        like, e.g., the x86 where hardware division delivers both quotient and
181        remainder at the same time.  With this, the implementation of the
182        round-to-neginf operations could be further streamlined.
183    
184      * Remove inlining support for div/mod/rem from the frontend and replace it
185        with primops that get carried through to the backend.  Do this for all
186        int and word types.
187    
188    ----------------------------------------------------------------------
189    Name: Matthias Blume
190    Date: 2002/03/25 17:25:00 EST
191    Tag: blume-20020325-divmod
192    Description:
193    
194    I improved (hopefully without breaking them) the implementation of Int.div,
195    Int.mod, and Int.rem.   For this, the code in translate.sml now takes
196    advantage of the following observations:
197    
198      Let  q = x quot y      r = x rem y
199           d = x div  y      m = x mod y
200    
201    where "quot" is the round-to-zero version of integer division that
202    hardware usually provides.  Then we have:
203    
204         r = x - q * y        where neither the * nor the - will overflow
205         d = if q >= 0 orelse x = q * y then q else q - 1
206                              where neither the * nor the - will overflow
207         m = if q >= 0 orelse r = 0 then r else r + y
208                              where the + will not overflow
209    
210    This results in substantial simplification of the generated code.
211    The following table shows the number of CFG nodes and edges generated
212    for
213            fun f (x, y) = x OPER y
214            (* with OPER \in div, mod, quot, rem *)
215    
216    
217        OPER | nodes(old) | edges(old) | nodes(new) | edges(new)
218        --------------------------------------------------------
219         div |         24 |         39 |         12 |         16
220         mod |         41 |         71 |         12 |         16
221        quot |          8 |         10 |          8 |         10
222         rem |         10 |         14 |          8 |         10
223    
224    
225    ----------------------------------------------------------------------
226    Name: Matthias Blume
227    Date: 2002/03/25 22:06:00 EST
228    Tag: blume-20020325-cprotobug
229    Description:
230    
231    Fixed a bug in cproto (c prototype decoder).
232    
233    ----------------------------------------------------------------------
234    Name: Matthias Blume
235    Date: 2002/03/25 16:00:00 EST
236    Tag: blume-20020325-raw-primops
237    Description:
238    
239    I did some cleanup to Allen's new primop code and
240    replaced yesterday's bootfiles with new ones.
241    (But they are stored in the same place.)
242    
243    ----------------------------------------------------------------------
244    Name: Matthias Blume
245    Date: 2002/03/24 22:40:00 EST
246    Tag: blume-20020324-bootfiles
247    Description:
248    
249    Made the bootfiles that Allen asked for.
250    
251    ----------------------------------------------------------------------
252    Name: Allen Leung
253    Date: 2002/03/23 15:50:00 EST
254    Tag: leunga-20020323-flint-cps-rcc-primops
255    Description:
256    
257      1. Changes to FLINT primops:
258    
259        (* make a call to a C-function;
260         * The primop carries C function prototype information and specifies
261         * which of its (ML-) arguments are floating point. C prototype
262         * information is for use by the backend, ML information is for
263         * use by the CPS converter. *)
264      | RAW_CCALL of { c_proto: CTypes.c_proto,
265                       ml_args: ccall_type list,
266                       ml_res_opt: ccall_type option,
267                       reentrant : bool
268                     } option
269       (* Allocate uninitialized storage on the heap.
270        * The record is meant to hold short-lived C objects, i.e., they
271        * are not ML pointers.  With the tag, the representation is
272        * the same as RECORD with tag tag_raw32 (sz=4), or tag_fblock (sz=8)
273        *)
274      | RAW_RECORD of {tag:bool,sz:int}
275      and ccall_type = CCALL_INT32 | CCALL_REAL64 | CCALL_ML_PTR
276    
277      2.  These CPS primops are now overloaded:
278    
279           rawload of {kind:numkind}
280           rawstore of {kind:numkind}
281    
282          The one argument form is:
283    
284             rawload {kind} address
285    
286          The two argument form is:
287    
288             rawload {kind} [ml object, byte-offset]
289    
290      3. RAW_CCALL/RCC now takes two extra arguments:
291    
292         a. The first is whether the C call is reentrant, i.e., whether
293            ML state should be saved and restored.
294         b. The second argument is a string argument specifying the name of
295            library and the C function.
296    
297         These things are currently not handled in the code generator, yet.
298    
299      4. In CProto,
300    
301         An encoding type of "bool" means "ml object" and is mapped into
302         C prototype of PTR.  Note that "bool" is different than "string",
303         even though "string" is also mapped into PTR, because "bool"
304         is assigned an CPS type of BOGt, while "string" is assigned INT32t.
305    
306      5. Pickler/unpicker
307    
308         Changed to handle RAW_RECORD and newest RAW_CCALL
309    
310      6. MLRiscGen,
311    
312         1. Changed to handle the new rawload/rawstore/rawrecord operators.
313         2. Code for handling C Calls has been moved to a new module CPSCCalls,
314            in the file CodeGen/cpscompile/cps-c-calls.sml
315    
316      7. Added the conditional move operator
317    
318             condmove of branch
319    
320         to cps.  Generation of this is still buggy so it is currently
321         disabled.
322    
323    ----------------------------------------------------------------------
324    Name: Lal George
325    Date: 2002/03/22 14:18:25 EST
326    Tag: george-20020322-cps-branch-prob
327    Description:
328    
329    Implemented the Ball-Larus branch prediction-heuristics, and
330    incorporated graphical viewers for control flow graphs.
331    
332    Ball-Larus Heuristics:
333    ---------------------
334    See the file compiler/CodeGen/cpscompile/cpsBranchProb.sml.
335    
336    By design it uses the Dempster-Shafer theory for combining
337    probabilities.  For example, in the function:
338    
339        fun f(n,acc) = if n = 0 then acc else f(n-1, n*acc)
340    
341    the ball-larus heuristics predicts that the n=0 is unlikely
342    (OH-heuristic), and the 'then' branch is unlikely because of the
343    RH-heuristic -- giving the 'then' branch an even lower combined
344    probability using the Dempster-Shafer theory.
345    
346    Finally, John Reppy's loop analysis in MLRISC, further lowers the
347    probability of the 'then' branch because of the loop in the else
348    branch.
349    
350    
351    Graphical Viewing:
352    ------------------
353    I merely plugged in Allen's graphical viewers into the compiler. The
354    additional code is not much. At the top level, saying:
355    
356            Control.MLRISC.getFlag "cfg-graphical-view" := true;
357    
358    will display the graphical view of the control flow graph just before
359    back-patching.  daVinci must be in your path for this to work. If
360    daVinci is not available, then the default viewer can be changed
361    using:
362    
363            Control.MLRISC.getString "viewer"
364    
365    which can be set to "dot" or "vcg" for the corresponding viewers. Of
366    course, these viewers must be in your path.
367    
368    The above will display the compilation unit at the level of clusters,
369    many of which are small, boring, and un-interesting. Also setting:
370    
371            Control.MLRISC.getInt "cfg-graphical-view_size"
372    
373    will display clusters that are larger than the value set by the above.
374    
375    
376    ----------------------------------------------------------------------
377    Name: Matthias Blume
378    Date: 2002/03/21 22:20:00 EST
379    Tag: blume-20020321-kmp-bugfix
380    Description:
381    
382    Changed the interface to the KMP routine in PreString and fixed
383    a minor bug in one place where it was used.
384    
385    ----------------------------------------------------------------------
386    Name: Allen Leung
387    Date: 2002/03/21 20:30:00 EST
388    Tag: leunga-20020321-cfg
389    Description:
390    
391      Fixed a potential problem in cfg edge splitting.
392    
393    ----------------------------------------------------------------------
394    Name: Allen Leung
395    Date: 2002/03/21 17:15:00 EST
396    Tag: leunga-20020321-x86-fp-cfg
397    Description:
398    
399      1. Recoded the buggy parts of x86-fp.
400    
401         a. All the block reordering code has been removed.
402            We now depend on the block placement phases to do this work.
403    
404         b. Critical edge splitting code has been simplified and moved into the
405            CFG modules, as where they belong.
406    
407         Both of these were quite buggy and complex.  The code is now much, much
408         simpler.
409    
410      2. X86 backend.
411    
412         a. Added instructions for 64-bit support.  Instruction selection for
413            64-bit has not been committed, however, since that
414            requires changes to MLTREE which haven't been approved by
415            Lal and John.
416    
417         b. Added support for FUCOMI and FUCOMIP when generating code for
418            PentiumPro and above.  We only generate these instructions in
419            the fast-fp mode.
420    
421         c. Added cases for JP and JNP in X86FreqProps.
422    
423      3. CFG
424    
425         CFG now has a bunch of methods for edge splitting and merging.
426    
427      4. Machine description.
428    
429         John's simplification of MLTREE_BASIS.fcond broke a few machine
430         description things:
431    
432         rtl-build.{sig,sml} and hppa.mdl fixed.
433    
434         NOTE: the machine description stuff in the repository is still broken.
435               Again, I can't put my fixes in because that involves
436               changes to MLTREE.
437    
438    ----------------------------------------------------------------------
439    Name: Matthias Blume
440    Date: 2002/03/20 15:55:00 EST
441    Tag: blume-20020320-kmp
442    Description:
443    
444    Implemented Knuth-Morris-Pratt string matching in PreString and used
445    it for String.isSubstring, Substring.isSubstring, and
446    Substring.position.
447    
448    (Might need some stress-testing.  Simple examples worked fine.)
449    
450    ----------------------------------------------------------------------
451    Name: Matthias Blume
452    Date: 2002/03/19 16:37:00 EST
453    Tag: blume-20020319-witnesses
454    Description:
455    
456    Added a structure C.W and functions convert/Ptr.convert to ml-nlffi-lib.
457    
458    This implements a generic mechanism for changing constness qualifiers
459    anywhere within big C types without resorting to outright "casts".
460    (So far, functions such as C.rw/C.ro or C.Ptr.rw/C.Ptr.ro only let you
461    modify the constness at the outermost level.)
462    The implementation of "convert" is based on the idea of "witness"
463    values -- values that are not used by the operation but whose types
464    "testify" to their applicability.  On the implementation side, "convert"
465    is simply a projection (returning its second curried argument).  With
466    cross-module inlining, it should not result in any machine code being
467    generated.
468    
469    ----------------------------------------------------------------------
470    Name: Matthias Blume
471    Date: 2002/03/15 16:40:00 EST
472    Tag: blume-20020315-basis
473    Description:
474    
475    Provided (preliminary?) implementations for
476    
477      {String,Substring}.{concatWith,isSuffix,isSubstring}
478    
479    and
480    
481      Substring.full
482    
483    Those are in the Basis spec but they were missing in SML/NJ.
484    
485    ----------------------------------------------------------------------
486    Name: Matthias Blume
487    Date: 2002/03/14 21:30:00 EST
488    Tag: blume-20020314-controls
489    Description:
490    
491    Controls:
492    ---------
493    
494    1. Factored out the recently-added Controls : CONTROLS stuff and put
495       it into its own library $/controls-lib.cm.  The source tree for
496       this is under src/smlnj-lib/Controls.
497    
498    2. Changed the names of types and functions in this interface, so they
499       make a bit more "sense":
500    
501          module -> registry
502          'a registry -> 'a group
503    
504    3. The interface now deals in ref cells only.  The getter/setter interface
505       is (mostly) gone.
506    
507    4. Added a function that lets one register an already-existing ref cell.
508    
509    5. Made the corresponding modifications to the rest of the code so that
510       everything compiles again.
511    
512    6. Changed the implementation of Controls.MLRISC back to something closer
513       to the original.  In particular, this module (and therefore MLRISC)
514       does not depend on Controls.  There now is some link-time code in
515       int-sys.sml that registers the MLRISC controls with the Controls
516       module.
517    
518    CM:
519    ---
520    
521      * One can now specify the lambda-split aggressiveness in init.cmi.
522    
523    ----------------------------------------------------------------------
524    Name: Allen Leung
525    Date: 2002/03/13 17:30:00 EST
526    Tag: leunga-20020313-x86-fp-unary
527    Description:
528    
529    Bug fix for:
530    
531    > leunga@weaselbane:~/Yale/tmp/sml-dist{21} bin/sml
532    > Standard ML of New Jersey v110.39.1 [FLINT v1.5], March 08, 2002
533    > - fun f(x,(y,z)) = Real.~ y;
534    > [autoloading]
535    > [autoloading done]
536    >       fchsl   (%eax), 184(%esp)
537    > Error: MLRisc bug: X86MCEmitter.emitInstr
538    >
539    > uncaught exception Error
540    >   raised at: ../MLRISC/control/mlriscErrormsg.sml:16.14-16.19
541    
542    The problem was that the code generator did not generate any fp registers
543    in this case, and the ra didn't know that it needed to run the X86FP phase to
544    translate the pseudo fp instruction.   This only happened with unary fp
545    operators in certain situations.
546    
547    ----------------------------------------------------------------------
548    Name: Matthias Blume
549    Date: 2002/03/13 14:00:00 EST
550    Tag: blume-20020313-overload-etc
551    Description:
552    
553    1. Added _overload as a synonym for overload for backward compatibility.
554       (Control.overloadKW must be true for either version to be accepted.)
555    
556    2. Fixed bug in install script that caused more things to be installed
557       than what was requested in config/targets.
558    
559    3. Made CM aware of the (_)overload construct so that autoloading
560       works.
561    
562    ----------------------------------------------------------------------
563    Name: Matthias Blume
564    Date: 2002/03/12 22:03:00 EST
565    Tag: blume-20020312-url
566    Description:
567    
568    Forgot to update BOOT and srcarchiveurl.
569    
570  ----------------------------------------------------------------------  ----------------------------------------------------------------------
571  Name: Matthias Blume  Name: Matthias Blume
572  Date: 2002/03/12 17:30:00 EST  Date: 2002/03/12 17:30:00 EST
# Line 27  Line 583 
583    provides a bit more "stability":  Once CM has seen a compilation    provides a bit more "stability":  Once CM has seen a compilation
584    unit, it keeps its identity constant (as long as you do not delete    unit, it keeps its identity constant (as long as you do not delete
585    those crucial CM/GUID/* files).  This means that when you change    those crucial CM/GUID/* files).  This means that when you change
586    and interface, compiler, then go back to the old interface, and    an interface, compile, then go back to the old interface, and
587    compile again, you arrive at the original pid.    compile again, you arrive at the original pid.
588    
589    There now also is a mechanism that instructs CM to use the plain    There now also is a mechanism that instructs CM to use the plain
# Line 102  Line 658 
658  ----------------------------------------------------------------------  ----------------------------------------------------------------------
659  Name: Allen Leung  Name: Allen Leung
660  Date: 2002/03/11 10:30:00 EST  Date: 2002/03/11 10:30:00 EST
661  Tag: leunga-20020310-runtime-string0  Tag: leunga-20020311-runtime-string0
662  Description:  Description:
663    
664     The representation of the empty string now points to a     The representation of the empty string now points to a

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

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