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 1168, Fri Mar 22 19:19:32 2002 UTC revision 1229, Fri May 31 21:10:34 2002 UTC
# Line 13  Line 13 
13  Description:  Description:
14    
15  ----------------------------------------------------------------------  ----------------------------------------------------------------------
16    Name: Matthias Blume
17    Date: 2002/05/31
18    Tag: blume-20020531-btrace-mode
19    Description:
20    
21    Resurrected SMLofNJ.Internals.BTrace.mode.  (It accidentally fell by
22    the wayside when I switched over to using Controls everywhere.)
23    
24    ----------------------------------------------------------------------
25    Name: Lal George
26    Date: 2002/05/23 12:21:40 EDT
27    Tag: george-20020523-visual-labels
28    Description:
29    
30    Labels are now displayed in the graphical output to make
31    the fall-through and target blocks obvious.
32    
33    ----------------------------------------------------------------------
34    Name: Matthias Blume
35    Date: 2002/05/22 11:03:00 EDT
36    Tag: blume-20020522-shrink
37    Description:
38    
39    John tweaked yesterday's fix for 1131 to handle an out-of-memory
40    situation that comes up when allocating huge arrays.
41    
42    ----------------------------------------------------------------------
43    Name: Matthias Blume
44    Date: 2002/05/21 16:00:00 EDT
45    Tag: Release_110_40
46    Description:
47    
48    New working release (110.40).  New bootfiles.
49    
50    [Also: John Reppy fixed GC bug 1131.]
51    
52    ----------------------------------------------------------------------
53    Name: Matthias Blume
54    Date: 2002/05/21 12:35:00 EDT
55    Tag: blume-20020521-cmdoc
56    Description:
57    
58    CM documentation update.
59    
60    ----------------------------------------------------------------------
61    Name: Matthias Blume
62    Date: 2002/05/21 10:55:00 EDT
63    Tag: blume-20020521-misc
64    Description:
65    
66    - John tweaked runtime to be silent on heap export (except when
67      GC messages are on).
68    - I added a few more things (cross-compiling versions of CMB) to
69      config/preloads (as suggestions).
70    
71    ----------------------------------------------------------------------
72    Name: Matthias Blume
73    Date: 2002/05/20 22:25:00 EDT
74    Tag: blume-20020520-controls
75    Description:
76    
77    - Added ControlUtil structure to control-lib.cm.
78    - Use it throughout.
79    - Used Controls facility to define MLRISC controls (as opposed to
80      registering MLRISC control ref cells with Controls after the fact)
81    - Fixed messed-up controls priorities.
82    
83    * Removed again all the stuff from config/preloads that one wouldn't
84      be able to preload at the time the initial heap image is built.
85      (Many libraries, e.g., CML, do not exist yet at this time.  The
86       only libraries that can be preloaded via config/preloads are those
87       that come bundled with the bootfiles.)
88    
89    ----------------------------------------------------------------------
90    Name: Matthias Blume
91    Date: 2002/05/20 10:59:00 EDT
92    Tag: blume-20020520-preloads
93    Description:
94    
95    Added a lot of commented-out suggestions for things to be included
96    in config/preloads.
97    
98    ----------------------------------------------------------------------
99    Name: Allen Leung
100    Date: 2002/05/18 14:20:00 EDT
101    Tag: leunga-20020518-mdl
102    Description:
103    
104    o Made the mdl tool stuff compile and run again.
105    o I've disabled all the stuff that depends on RTL specifications; they
106      are all badly broken anyway.
107    
108    ----------------------------------------------------------------------
109    Name: Matthias Blume
110    Date: 2002/05/17 16:49:00 EDT
111    Tag: blume-20020517-controls
112    Description:
113    
114    0. John Reppy made several modifications to the SML/NJ library.
115       In particular, there is a shiny new controls-lib.cm.
116    
117    1. Pushed new controls interface through compiler so that everything
118       compiles again.
119    
120    2. Added FormatComb and FORMAT_COMB to the CML version of the
121       SML/NJ library (so that CML compiles again).
122    
123    3. Modified init scripts because XXX_DEFAULT environment variables
124       are no longer with us.  (Boot-time initialization is now done
125       using the same environment variables that are also used for
126       startup-time initialization of controls.)
127    
128    ----------------------------------------------------------------------
129    Name: Lal George
130    Date: 2002/05/15 09:20:10 EDT
131    Tag: george-20020515-pseudo-op-decls
132    Description:
133    
134            All pseudo-ops emitted before the first segment declaration
135    such as TEXT, DATA, and BSS directives are assumed to be global
136    declarations and are emitted first in the assembly file. This is
137    useful in a number of situations where one has pseudo-ops that are not
138    specific to any segment, and also works around the constraint that one
139    cannot have client pseudo-ops in the TEXT segment.
140    
141            Because no segment is associated with these declarations it is
142    an error to allocate any space or objects before the first segment
143    directive and an exception will be raised. However, we cannot make
144    this check for client pseudo-ops.
145    
146            These top level declarations are a field in the CFG graph_info.
147    In theory you can continue to add to this field after the CFG has been
148    built -- provided you know what you are doing;-)
149    
150    ----------------------------------------------------------------------
151    Name: Matthias Blume
152    Date: 2002/05/13 16:40:00 EDT
153    Tag: blume-20020513-pp-etc
154    Description:
155    
156    A few minor bugfixes:
157    
158      - Stopgap measure for bug recently reported by Elsa Gunter (ppDec).
159        (Bogus printouts for redefined bindings still occur.  Compiler
160        bug should no longer occur now.  We need to redo the prettyprinter
161        from scratch.)
162    
163      - CM pathname printer now also adds escape sequences for ( and )
164    
165      - commend and docu fixes for ml-nlffi
166    
167    ----------------------------------------------------------------------
168    Name: Matthias Blume
169    Date: 2002/05/10 16:40:00 EDT
170    Tag: blume-20020510-erg-textio
171    Description:
172    
173    Applied the following bugfix provided by Emden Gansner:
174    
175        Output is corrupted when outputSubstr is used rather than output.
176    
177        The problem occurs when a substring
178    
179            ss = (s, dataStart, dataLen)
180    
181        where dataStart > 0, fills a stream buffer with avail bytes left.
182        avail bytes of s, starting at index dataStart, are copied into the
183        buffer, the buffer is flushed, and then the remaining dataLen-avail
184        bytes of ss are copied into the beginning of the buffer. Instead of
185        starting this copy at index dataStart+avail in s, the current code
186        starts the copy at index avail.
187    
188        Fix:
189        In text-io-fn.sml, change line 695 from
190             val needsFlush = copyVec(v, avail, dataLen-avail, buf, 0)
191        to
192             val needsFlush = copyVec(v, dataStart+avail, dataLen-avail, buf, 0)
193    
194    ----------------------------------------------------------------------
195    Name: Matthias Blume
196    Date: 2002/04/12 13:55:00 EDT
197    Tag: blume-20020412-assyntax
198    Description:
199    
200    1. Grabbed newer assyntax.h from the XFree86 project.
201    2. Fiddled with how to compile X86.prim.asm without warnings.
202    3. (Very) Minor cleanup in CM.
203    
204    ----------------------------------------------------------------------
205    Name: Matthias Blume
206    Date: 2002/04/01 (no joke!) 17:07:00 EST
207    Tag: blume-20020401-x86div
208    Description:
209    
210    Added full support for div/mod/rem/quot on the x86, using the machine
211    instruction's two results (without clumsily recomputing the remainder)
212    directly where appropriate.
213    
214    Some more extensive power-of-two support was added to the x86 instruction
215    selector (avoiding expensive divs, mods, and muls where they can be
216    replaced with cheaper shifts and masks).  However, this sort of thing
217    ought to be done earlier, e.g., within the CPS optimizer so that
218    all architectures benefit from it.
219    
220    The compiler compiles to a fixed point, but changes might be somewhat
221    fragile nevertheless.  Please, report any strange things that you might
222    see wrt. div/mod/quot/rem...
223    
224    ----------------------------------------------------------------------
225    Name: Matthias Blume
226    Date: 2002/03/29 17:22:00
227    Tag: blume-20020329-div
228    Description:
229    
230    Fixed my broken div/mod logic.  Unfortunately, this means that the
231    inline code for div/mod now has one more comparison than before.
232    Fast paths (quotient > 0 or remainder = 0) are not affected, though.
233    The problem was with quotient = 0, because that alone does not tell
234    us which way the rounding went.  One then has to look at whether
235    remainder and divisor have the same sign...  :(
236    
237    Anyway, I replaced the bootfiles with fresh ones...
238    
239    ----------------------------------------------------------------------
240    Name: Matthias Blume
241    Date: 2002/03/29 14:10:00 EST
242    Tag: blume-20020329-inlprims
243    Description:
244    
245    NEW BOOTFILES!!!    Version number bumped to 110.39.3.
246    
247    Primops have changed. This means that the bin/boot-file formats have
248    changed as well.
249    
250    To make sure that there is no confusion, I made a new version.
251    
252    
253    CHANGES:
254    
255    * removed REMT from mltree (remainder should never overflow).
256    
257    * added primops to deal with divisions of all flavors to the frontend
258    
259    * handled these primops all the way through so they map to their respective
260      MLRISC support
261    
262    * used these primops in the implementation of Int, Int32, Word, Word32
263    
264    * removed INLDIV, INLMOD, and INLREM as they are no longer necessary
265    
266    * parameterized INLMIN, INLMAX, and INLABS by a numkind
267    
268    * translate.sml now deals with all flavors of INL{MIN,MAX,ABS}, including
269      floating point
270    
271    * used INL{MIN,MAX,ABS} in the implementation of Int, Int32, Word, Word32,
272      and Real (but Real.abs maps to a separate floating-point-only primop)
273    
274    
275    TODO items:
276    
277    * Hacked Alpha32 instruction selection, disabling the selection of REMx
278      instructions because the machine instruction encoder cannot handle
279      them.  (Hppa, PPC, and Sparc instruction selection did not handle
280      REM in the first place, and REM is supported by the x86 machine coder.)
281    
282    * Handle DIV and MOD with DIV_TO_NEGINF directly in the x86 instruction
283      selection phase.  (The two can be streamlined because the hardware
284      delivers both quotient and remainder at the same time anyway.)
285    
286    * Think about what to do with "valOf(Int32.minInt) div ~1" and friends.
287      (Currently the behavior is inconsistent both across architectures and
288      wrt. the draft Basis spec.)
289    
290    * Word8 should eventually be handled natively, too.
291    
292    * There seems to be one serious bug in mltree-gen.sml.  It appears, though,
293      as if there currently is no execution path that could trigger it in
294      SML/NJ.  (The assumptions underlying functions arith and promotable do not
295      hold for things like multiplication and division.)
296    
297    ----------------------------------------------------------------------
298    Name: Matthias Blume
299    Date: 2002/03/27 16:27:00 EST
300    Tag: blume-20020327-mlrisc-divisions
301    Description:
302    
303    Added support for all four division operations (ML's div, mod, quot,
304    and rem) to MLRISC.  In the course of doing so, I also rationalized
305    the naming (no more annoying switch-around of DIV and QUOT), by
306    parameterizing the operation by div_rounding_mode (which can be either
307    DIV_TO_ZERO or DIV_TO_NEGINF).
308    
309    The generic MLTreeGen functor takes care of compiling all four
310    operations down to only round-to-zero div.
311    
312    Missing pieces:
313    
314      * Doing something smarter than relying on MLTreeGen on architectures
315        like, e.g., the x86 where hardware division delivers both quotient and
316        remainder at the same time.  With this, the implementation of the
317        round-to-neginf operations could be further streamlined.
318    
319      * Remove inlining support for div/mod/rem from the frontend and replace it
320        with primops that get carried through to the backend.  Do this for all
321        int and word types.
322    
323    ----------------------------------------------------------------------
324    Name: Matthias Blume
325    Date: 2002/03/25 17:25:00 EST
326    Tag: blume-20020325-divmod
327    Description:
328    
329    I improved (hopefully without breaking them) the implementation of Int.div,
330    Int.mod, and Int.rem.   For this, the code in translate.sml now takes
331    advantage of the following observations:
332    
333      Let  q = x quot y      r = x rem y
334           d = x div  y      m = x mod y
335    
336    where "quot" is the round-to-zero version of integer division that
337    hardware usually provides.  Then we have:
338    
339         r = x - q * y        where neither the * nor the - will overflow
340         d = if q >= 0 orelse x = q * y then q else q - 1
341                              where neither the * nor the - will overflow
342         m = if q >= 0 orelse r = 0 then r else r + y
343                              where the + will not overflow
344    
345    This results in substantial simplification of the generated code.
346    The following table shows the number of CFG nodes and edges generated
347    for
348            fun f (x, y) = x OPER y
349            (* with OPER \in div, mod, quot, rem *)
350    
351    
352        OPER | nodes(old) | edges(old) | nodes(new) | edges(new)
353        --------------------------------------------------------
354         div |         24 |         39 |         12 |         16
355         mod |         41 |         71 |         12 |         16
356        quot |          8 |         10 |          8 |         10
357         rem |         10 |         14 |          8 |         10
358    
359    
360    ----------------------------------------------------------------------
361    Name: Matthias Blume
362    Date: 2002/03/25 22:06:00 EST
363    Tag: blume-20020325-cprotobug
364    Description:
365    
366    Fixed a bug in cproto (c prototype decoder).
367    
368    ----------------------------------------------------------------------
369    Name: Matthias Blume
370    Date: 2002/03/25 16:00:00 EST
371    Tag: blume-20020325-raw-primops
372    Description:
373    
374    I did some cleanup to Allen's new primop code and
375    replaced yesterday's bootfiles with new ones.
376    (But they are stored in the same place.)
377    
378    ----------------------------------------------------------------------
379    Name: Matthias Blume
380    Date: 2002/03/24 22:40:00 EST
381    Tag: blume-20020324-bootfiles
382    Description:
383    
384    Made the bootfiles that Allen asked for.
385    
386    ----------------------------------------------------------------------
387    Name: Allen Leung
388    Date: 2002/03/23 15:50:00 EST
389    Tag: leunga-20020323-flint-cps-rcc-primops
390    Description:
391    
392      1. Changes to FLINT primops:
393    
394        (* make a call to a C-function;
395         * The primop carries C function prototype information and specifies
396         * which of its (ML-) arguments are floating point. C prototype
397         * information is for use by the backend, ML information is for
398         * use by the CPS converter. *)
399      | RAW_CCALL of { c_proto: CTypes.c_proto,
400                       ml_args: ccall_type list,
401                       ml_res_opt: ccall_type option,
402                       reentrant : bool
403                     } option
404       (* Allocate uninitialized storage on the heap.
405        * The record is meant to hold short-lived C objects, i.e., they
406        * are not ML pointers.  With the tag, the representation is
407        * the same as RECORD with tag tag_raw32 (sz=4), or tag_fblock (sz=8)
408        *)
409      | RAW_RECORD of {tag:bool,sz:int}
410      and ccall_type = CCALL_INT32 | CCALL_REAL64 | CCALL_ML_PTR
411    
412      2.  These CPS primops are now overloaded:
413    
414           rawload of {kind:numkind}
415           rawstore of {kind:numkind}
416    
417          The one argument form is:
418    
419             rawload {kind} address
420    
421          The two argument form is:
422    
423             rawload {kind} [ml object, byte-offset]
424    
425      3. RAW_CCALL/RCC now takes two extra arguments:
426    
427         a. The first is whether the C call is reentrant, i.e., whether
428            ML state should be saved and restored.
429         b. The second argument is a string argument specifying the name of
430            library and the C function.
431    
432         These things are currently not handled in the code generator, yet.
433    
434      4. In CProto,
435    
436         An encoding type of "bool" means "ml object" and is mapped into
437         C prototype of PTR.  Note that "bool" is different than "string",
438         even though "string" is also mapped into PTR, because "bool"
439         is assigned an CPS type of BOGt, while "string" is assigned INT32t.
440    
441      5. Pickler/unpicker
442    
443         Changed to handle RAW_RECORD and newest RAW_CCALL
444    
445      6. MLRiscGen,
446    
447         1. Changed to handle the new rawload/rawstore/rawrecord operators.
448         2. Code for handling C Calls has been moved to a new module CPSCCalls,
449            in the file CodeGen/cpscompile/cps-c-calls.sml
450    
451      7. Added the conditional move operator
452    
453             condmove of branch
454    
455         to cps.  Generation of this is still buggy so it is currently
456         disabled.
457    
458    ----------------------------------------------------------------------
459  Name: Lal George  Name: Lal George
460  Date: 2002/03/22 14:18:25 EST  Date: 2002/03/22 14:18:25 EST
461  Tag: blume-20020321-cps-branch-prob  Tag: george-20020322-cps-branch-prob
462  Description:  Description:
463    
464  Implemented the Ball-Larus branch prediction-heuristic, and  Implemented the Ball-Larus branch prediction-heuristics, and
465  incorporated graphical viewers for control flow graphs.  incorporated graphical viewers for control flow graphs.
466    
467  Ball-Larus Heuristic:  Ball-Larus Heuristics:
468  ---------------------  ---------------------
469  See the file compiler/CodeGen/cpscompile/cpsBranchProb.sml.  See the file compiler/CodeGen/cpscompile/cpsBranchProb.sml.
470    
# Line 33  Line 476 
476  the ball-larus heuristics predicts that the n=0 is unlikely  the ball-larus heuristics predicts that the n=0 is unlikely
477  (OH-heuristic), and the 'then' branch is unlikely because of the  (OH-heuristic), and the 'then' branch is unlikely because of the
478  RH-heuristic -- giving the 'then' branch an even lower combined  RH-heuristic -- giving the 'then' branch an even lower combined
479  probability using the Dempster-Shater theory.  probability using the Dempster-Shafer theory.
480    
481  Finally, John Reppy's loop analysis in MLRISC, further lowers the  Finally, John Reppy's loop analysis in MLRISC, further lowers the
482  probability of the 'then' branch because of the loop in the else  probability of the 'then' branch because of the loop in the else

Legend:
Removed from v.1168  
changed lines
  Added in v.1229

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